./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 161bb7a2aeb8f0e9fdffca01ff4293552e60c655d94a257edfbbb7105096b1f1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:04:23,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:04:23,251 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:04:23,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:04:23,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:04:23,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:04:23,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:04:23,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:04:23,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:04:23,299 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:04:23,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:04:23,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:04:23,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:04:23,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:04:23,302 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:04:23,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:04:23,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:04:23,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:04:23,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:04:23,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:04:23,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:04:23,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:04:23,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:04:23,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:04:23,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:04:23,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:04:23,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:04:23,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:04:23,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:04:23,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:04:23,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:04:23,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:04:23,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:23,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:04:23,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:04:23,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:04:23,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:04:23,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:04:23,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:04:23,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:04:23,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:04:23,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:04:23,314 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 161bb7a2aeb8f0e9fdffca01ff4293552e60c655d94a257edfbbb7105096b1f1 [2024-10-31 22:04:23,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:04:23,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:04:23,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:04:23,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:04:23,665 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:04:23,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i Unable to find full path for "g++" [2024-10-31 22:04:26,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:04:26,441 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:04:26,442 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i [2024-10-31 22:04:26,457 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/data/efb24e076/e2b25918bae441d78abf6aabeccd6129/FLAGcce181105 [2024-10-31 22:04:26,608 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/data/efb24e076/e2b25918bae441d78abf6aabeccd6129 [2024-10-31 22:04:26,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:04:26,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:04:26,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:26,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:04:26,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:04:26,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:26" (1/1) ... [2024-10-31 22:04:26,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e594ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:26, skipping insertion in model container [2024-10-31 22:04:26,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:26" (1/1) ... [2024-10-31 22:04:26,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:04:26,975 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i[916,929] [2024-10-31 22:04:27,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:27,128 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:04:27,141 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i[916,929] [2024-10-31 22:04:27,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:27,246 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:04:27,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27 WrapperNode [2024-10-31 22:04:27,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:27,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:27,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:04:27,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:04:27,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,338 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 339 [2024-10-31 22:04:27,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:27,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:04:27,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:04:27,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:04:27,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,381 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:04:27,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:04:27,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:04:27,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:04:27,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:04:27,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (1/1) ... [2024-10-31 22:04:27,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:27,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:27,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:04:27,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:04:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:04:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:04:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:04:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:04:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:04:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:04:27,670 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:04:27,674 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:04:28,584 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-31 22:04:28,584 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:04:28,602 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:04:28,602 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:04:28,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:28 BoogieIcfgContainer [2024-10-31 22:04:28,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:04:28,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:04:28,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:04:28,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:04:28,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:04:26" (1/3) ... [2024-10-31 22:04:28,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a316b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:28, skipping insertion in model container [2024-10-31 22:04:28,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:27" (2/3) ... [2024-10-31 22:04:28,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a316b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:28, skipping insertion in model container [2024-10-31 22:04:28,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:28" (3/3) ... [2024-10-31 22:04:28,620 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-36.i [2024-10-31 22:04:28,643 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:04:28,644 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:04:28,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:04:28,775 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@348c8b3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:04:28,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:04:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 111 states have (on average 1.4864864864864864) internal successors, (165), 112 states have internal predecessors, (165), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 22:04:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-31 22:04:28,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:28,832 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:28,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:28,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2143883725, now seen corresponding path program 1 times [2024-10-31 22:04:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295702740] [2024-10-31 22:04:28,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:04:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:04:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:04:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:04:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:04:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:04:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:04:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:04:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:04:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:04:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:04:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:04:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:04:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:04:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:04:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:04:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:04:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:04:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:04:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:04:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:04:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 22:04:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:04:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 22:04:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:04:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 22:04:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-31 22:04:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-31 22:04:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 22:04:29,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:29,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295702740] [2024-10-31 22:04:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295702740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:29,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:29,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:04:29,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129941076] [2024-10-31 22:04:29,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:29,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:04:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:04:29,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:04:29,656 INFO L87 Difference]: Start difference. First operand has 142 states, 111 states have (on average 1.4864864864864864) internal successors, (165), 112 states have internal predecessors, (165), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-31 22:04:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:29,731 INFO L93 Difference]: Finished difference Result 281 states and 467 transitions. [2024-10-31 22:04:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:04:29,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 195 [2024-10-31 22:04:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:29,747 INFO L225 Difference]: With dead ends: 281 [2024-10-31 22:04:29,748 INFO L226 Difference]: Without dead ends: 138 [2024-10-31 22:04:29,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:04:29,761 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:29,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:04:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-31 22:04:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-31 22:04:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.462962962962963) internal successors, (158), 108 states have internal predecessors, (158), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 22:04:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 214 transitions. [2024-10-31 22:04:29,844 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 214 transitions. Word has length 195 [2024-10-31 22:04:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:29,848 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 214 transitions. [2024-10-31 22:04:29,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-31 22:04:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 214 transitions. [2024-10-31 22:04:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-31 22:04:29,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:29,856 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:29,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:04:29,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:29,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:29,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1841864517, now seen corresponding path program 1 times [2024-10-31 22:04:29,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:29,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773615999] [2024-10-31 22:04:29,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:04:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:04:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:04:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:04:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:04:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:04:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:04:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:04:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:04:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:04:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:04:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:04:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:04:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:04:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:04:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:04:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:04:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:04:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:04:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:04:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:04:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 22:04:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:04:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 22:04:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:04:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 22:04:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-31 22:04:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-31 22:04:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 22:04:30,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:30,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773615999] [2024-10-31 22:04:30,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773615999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:30,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:30,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:30,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386598263] [2024-10-31 22:04:30,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:30,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:30,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:30,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:30,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:30,388 INFO L87 Difference]: Start difference. First operand 138 states and 214 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:30,569 INFO L93 Difference]: Finished difference Result 273 states and 425 transitions. [2024-10-31 22:04:30,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:30,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2024-10-31 22:04:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:30,573 INFO L225 Difference]: With dead ends: 273 [2024-10-31 22:04:30,573 INFO L226 Difference]: Without dead ends: 138 [2024-10-31 22:04:30,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:30,576 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:30,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 375 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:04:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-31 22:04:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-31 22:04:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 108 states have internal predecessors, (157), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 22:04:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 213 transitions. [2024-10-31 22:04:30,591 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 213 transitions. Word has length 195 [2024-10-31 22:04:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:30,593 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 213 transitions. [2024-10-31 22:04:30,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 213 transitions. [2024-10-31 22:04:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-31 22:04:30,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:30,597 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:30,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:04:30,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:30,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1638684030, now seen corresponding path program 1 times [2024-10-31 22:04:30,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:30,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407828323] [2024-10-31 22:04:30,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:04:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:04:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:04:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:04:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:04:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:04:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:04:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:04:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:04:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:04:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:04:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:04:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:04:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:04:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:04:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:04:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:04:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:04:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:04:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:04:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:04:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 22:04:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:04:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 22:04:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:04:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 22:04:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-31 22:04:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-31 22:04:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 22:04:30,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:30,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407828323] [2024-10-31 22:04:30,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407828323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:30,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:30,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529538115] [2024-10-31 22:04:30,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:30,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:30,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:30,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:30,927 INFO L87 Difference]: Start difference. First operand 138 states and 213 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:31,131 INFO L93 Difference]: Finished difference Result 398 states and 619 transitions. [2024-10-31 22:04:31,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:31,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197 [2024-10-31 22:04:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:31,136 INFO L225 Difference]: With dead ends: 398 [2024-10-31 22:04:31,136 INFO L226 Difference]: Without dead ends: 263 [2024-10-31 22:04:31,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:31,146 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 180 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:31,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 484 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:04:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-31 22:04:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2024-10-31 22:04:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 201 states have (on average 1.427860696517413) internal successors, (287), 201 states have internal predecessors, (287), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-31 22:04:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 399 transitions. [2024-10-31 22:04:31,195 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 399 transitions. Word has length 197 [2024-10-31 22:04:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:31,196 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 399 transitions. [2024-10-31 22:04:31,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 399 transitions. [2024-10-31 22:04:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-31 22:04:31,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:31,203 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:31,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:04:31,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:31,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2064256433, now seen corresponding path program 1 times [2024-10-31 22:04:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763763154] [2024-10-31 22:04:31,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:31,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:04:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:04:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:04:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:04:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:04:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:04:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:04:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:04:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:04:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:04:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:04:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:04:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:04:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:04:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:04:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:04:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:04:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:04:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:04:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:04:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:04:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 22:04:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:04:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 22:04:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:04:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 22:04:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-31 22:04:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-31 22:04:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 22:04:31,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:31,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763763154] [2024-10-31 22:04:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763763154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:31,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:31,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445188584] [2024-10-31 22:04:31,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:31,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:31,467 INFO L87 Difference]: Start difference. First operand 260 states and 399 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:31,558 INFO L93 Difference]: Finished difference Result 772 states and 1187 transitions. [2024-10-31 22:04:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:31,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2024-10-31 22:04:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:31,567 INFO L225 Difference]: With dead ends: 772 [2024-10-31 22:04:31,567 INFO L226 Difference]: Without dead ends: 515 [2024-10-31 22:04:31,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:31,572 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 202 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:31,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 408 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:04:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-31 22:04:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2024-10-31 22:04:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 394 states have (on average 1.416243654822335) internal successors, (558), 394 states have internal predecessors, (558), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-31 22:04:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 782 transitions. [2024-10-31 22:04:31,621 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 782 transitions. Word has length 198 [2024-10-31 22:04:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:31,621 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 782 transitions. [2024-10-31 22:04:31,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 782 transitions. [2024-10-31 22:04:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-31 22:04:31,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:31,625 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:31,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:04:31,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:31,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:31,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1477450419, now seen corresponding path program 1 times [2024-10-31 22:04:31,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:31,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427560706] [2024-10-31 22:04:31,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:31,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:04:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:04:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:04:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:04:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:04:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:04:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:04:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:04:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:04:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:04:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:04:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:04:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:04:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:04:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:04:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:04:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:04:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:04:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:04:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:04:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:04:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 22:04:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:04:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 22:04:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:04:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 22:04:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-31 22:04:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-31 22:04:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 22:04:32,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:32,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427560706] [2024-10-31 22:04:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427560706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:32,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:32,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930969398] [2024-10-31 22:04:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:32,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:32,005 INFO L87 Difference]: Start difference. First operand 511 states and 782 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:32,242 INFO L93 Difference]: Finished difference Result 1285 states and 1974 transitions. [2024-10-31 22:04:32,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:32,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2024-10-31 22:04:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:32,250 INFO L225 Difference]: With dead ends: 1285 [2024-10-31 22:04:32,251 INFO L226 Difference]: Without dead ends: 777 [2024-10-31 22:04:32,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:32,255 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 193 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:32,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 446 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:04:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-31 22:04:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 773. [2024-10-31 22:04:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 598 states have (on average 1.4214046822742474) internal successors, (850), 598 states have internal predecessors, (850), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-31 22:04:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1186 transitions. [2024-10-31 22:04:32,344 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1186 transitions. Word has length 198 [2024-10-31 22:04:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:32,346 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1186 transitions. [2024-10-31 22:04:32,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1186 transitions. [2024-10-31 22:04:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-31 22:04:32,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:32,351 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:32,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:04:32,352 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:32,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash 432384323, now seen corresponding path program 1 times [2024-10-31 22:04:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:32,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553549752] [2024-10-31 22:04:32,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:32,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:04:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:04:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:04:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:04:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:04:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:04:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:04:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:04:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:04:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:04:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:04:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:04:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:04:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:04:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:04:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:04:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:04:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:04:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:04:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:04:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:04:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 22:04:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:04:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 22:04:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:04:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 22:04:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-31 22:04:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-31 22:04:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 22:04:32,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:32,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553549752] [2024-10-31 22:04:32,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553549752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:32,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:32,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:04:32,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744900041] [2024-10-31 22:04:32,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:32,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:04:32,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:32,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:04:32,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:32,786 INFO L87 Difference]: Start difference. First operand 773 states and 1186 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:33,229 INFO L93 Difference]: Finished difference Result 1567 states and 2404 transitions. [2024-10-31 22:04:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:04:33,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2024-10-31 22:04:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:33,236 INFO L225 Difference]: With dead ends: 1567 [2024-10-31 22:04:33,236 INFO L226 Difference]: Without dead ends: 791 [2024-10-31 22:04:33,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:33,240 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 435 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:33,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 695 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:04:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-10-31 22:04:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 781. [2024-10-31 22:04:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 606 states have (on average 1.4191419141914192) internal successors, (860), 606 states have internal predecessors, (860), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-31 22:04:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1196 transitions. [2024-10-31 22:04:33,307 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1196 transitions. Word has length 198 [2024-10-31 22:04:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:33,310 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1196 transitions. [2024-10-31 22:04:33,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1196 transitions. [2024-10-31 22:04:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-31 22:04:33,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:33,314 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:33,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:04:33,314 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:33,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1373054011, now seen corresponding path program 1 times [2024-10-31 22:04:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:33,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260723989] [2024-10-31 22:04:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:04:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:04:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:04:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:04:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:04:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:04:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:04:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:04:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:04:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:04:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:04:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:04:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:04:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:04:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:04:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:04:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:04:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:04:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:04:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:04:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:04:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 22:04:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:04:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 22:04:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:04:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 22:04:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-31 22:04:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-31 22:04:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 22:04:33,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:33,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260723989] [2024-10-31 22:04:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260723989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790423209] [2024-10-31 22:04:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:33,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:33,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:33,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:33,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:33,826 INFO L87 Difference]: Start difference. First operand 781 states and 1196 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:34,376 INFO L93 Difference]: Finished difference Result 2071 states and 3174 transitions. [2024-10-31 22:04:34,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:04:34,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2024-10-31 22:04:34,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:34,385 INFO L225 Difference]: With dead ends: 2071 [2024-10-31 22:04:34,385 INFO L226 Difference]: Without dead ends: 1293 [2024-10-31 22:04:34,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:34,388 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 190 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:34,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 446 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:04:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2024-10-31 22:04:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1047. [2024-10-31 22:04:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 814 states have (on average 1.4226044226044225) internal successors, (1158), 814 states have internal predecessors, (1158), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-31 22:04:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1606 transitions. [2024-10-31 22:04:34,518 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1606 transitions. Word has length 198 [2024-10-31 22:04:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:34,519 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1606 transitions. [2024-10-31 22:04:34,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1606 transitions. [2024-10-31 22:04:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-31 22:04:34,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:34,523 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:34,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:04:34,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:34,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1122046416, now seen corresponding path program 1 times [2024-10-31 22:04:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821118429] [2024-10-31 22:04:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:04:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:04:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:04:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:04:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:04:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:04:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:04:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:04:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:04:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:04:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:04:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:04:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:04:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:04:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:04:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:04:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:04:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:04:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:04:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:04:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:04:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 22:04:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:04:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 22:04:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:04:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 22:04:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-31 22:04:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-31 22:04:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 27 proven. 54 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-31 22:04:35,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821118429] [2024-10-31 22:04:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821118429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:04:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927385364] [2024-10-31 22:04:35,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:35,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:04:35,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:35,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:04:35,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:04:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:35,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-31 22:04:35,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:04:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 763 proven. 33 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-10-31 22:04:35,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:04:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 48 proven. 33 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-31 22:04:36,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927385364] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:04:36,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:04:36,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-10-31 22:04:36,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874320933] [2024-10-31 22:04:36,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:04:36,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:04:36,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:36,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:04:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:04:36,044 INFO L87 Difference]: Start difference. First operand 1047 states and 1606 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2024-10-31 22:04:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:37,031 INFO L93 Difference]: Finished difference Result 2509 states and 3742 transitions. [2024-10-31 22:04:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 22:04:37,032 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) Word has length 199 [2024-10-31 22:04:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:37,042 INFO L225 Difference]: With dead ends: 2509 [2024-10-31 22:04:37,043 INFO L226 Difference]: Without dead ends: 1449 [2024-10-31 22:04:37,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2024-10-31 22:04:37,047 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 844 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:37,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 510 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:04:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-10-31 22:04:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1377. [2024-10-31 22:04:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1078 states have (on average 1.3543599257884973) internal successors, (1460), 1084 states have internal predecessors, (1460), 266 states have call successors, (266), 32 states have call predecessors, (266), 32 states have return successors, (266), 260 states have call predecessors, (266), 266 states have call successors, (266) [2024-10-31 22:04:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1992 transitions. [2024-10-31 22:04:37,255 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1992 transitions. Word has length 199 [2024-10-31 22:04:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:37,256 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1992 transitions. [2024-10-31 22:04:37,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2024-10-31 22:04:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1992 transitions. [2024-10-31 22:04:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-31 22:04:37,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:37,260 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:37,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:04:37,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:04:37,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:37,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1251016244, now seen corresponding path program 1 times [2024-10-31 22:04:37,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:37,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992059913] [2024-10-31 22:04:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:04:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:04:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:04:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:04:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:04:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:04:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:04:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:04:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:04:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:04:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:04:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:04:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:04:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:04:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:04:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:04:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:04:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:04:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:04:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:04:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:04:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 22:04:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:04:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 22:04:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:04:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 22:04:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-31 22:04:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-31 22:04:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 22:04:37,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:37,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992059913] [2024-10-31 22:04:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992059913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:37,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:37,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186475917] [2024-10-31 22:04:37,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:37,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:37,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:37,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:37,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:37,699 INFO L87 Difference]: Start difference. First operand 1377 states and 1992 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:37,872 INFO L93 Difference]: Finished difference Result 3365 states and 4862 transitions. [2024-10-31 22:04:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:37,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 199 [2024-10-31 22:04:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:37,886 INFO L225 Difference]: With dead ends: 3365 [2024-10-31 22:04:37,886 INFO L226 Difference]: Without dead ends: 1991 [2024-10-31 22:04:37,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:37,893 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 111 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:37,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 455 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:04:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2024-10-31 22:04:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1631. [2024-10-31 22:04:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1332 states have (on average 1.3633633633633633) internal successors, (1816), 1338 states have internal predecessors, (1816), 266 states have call successors, (266), 32 states have call predecessors, (266), 32 states have return successors, (266), 260 states have call predecessors, (266), 266 states have call successors, (266) [2024-10-31 22:04:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2348 transitions. [2024-10-31 22:04:38,071 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2348 transitions. Word has length 199 [2024-10-31 22:04:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:38,072 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2348 transitions. [2024-10-31 22:04:38,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2348 transitions. [2024-10-31 22:04:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-31 22:04:38,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:38,077 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:38,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:04:38,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:38,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash -224582884, now seen corresponding path program 1 times [2024-10-31 22:04:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:38,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71910674] [2024-10-31 22:04:38,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:38,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:04:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:04:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:04:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:04:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:04:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-31 22:04:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:04:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:04:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:04:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:04:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:04:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:04:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:04:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:04:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:04:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:04:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:04:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:04:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:04:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 22:04:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 22:04:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 22:04:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-31 22:04:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 22:04:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 22:04:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 22:04:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-31 22:04:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-31 22:04:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 22:04:38,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:38,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71910674] [2024-10-31 22:04:38,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71910674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:38,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:38,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:38,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346325857] [2024-10-31 22:04:38,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:38,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:38,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:38,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:38,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:38,494 INFO L87 Difference]: Start difference. First operand 1631 states and 2348 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:38,913 INFO L93 Difference]: Finished difference Result 3644 states and 5189 transitions. [2024-10-31 22:04:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:04:38,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 200 [2024-10-31 22:04:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:38,925 INFO L225 Difference]: With dead ends: 3644 [2024-10-31 22:04:38,925 INFO L226 Difference]: Without dead ends: 2016 [2024-10-31 22:04:38,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:38,930 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 295 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:38,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 701 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:04:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2024-10-31 22:04:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1664. [2024-10-31 22:04:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1372 states have (on average 1.349125364431487) internal successors, (1851), 1378 states have internal predecessors, (1851), 259 states have call successors, (259), 32 states have call predecessors, (259), 32 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259) [2024-10-31 22:04:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2369 transitions. [2024-10-31 22:04:39,125 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2369 transitions. Word has length 200 [2024-10-31 22:04:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:39,126 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2369 transitions. [2024-10-31 22:04:39,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-31 22:04:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2369 transitions. [2024-10-31 22:04:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-31 22:04:39,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:39,129 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:39,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:04:39,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:39,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2041133527, now seen corresponding path program 1 times [2024-10-31 22:04:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:39,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199831308] [2024-10-31 22:04:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:39,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 22:04:39,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680869157] [2024-10-31 22:04:39,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:39,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:04:39,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:39,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:04:39,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:04:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:04:39,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:04:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:04:39,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:04:39,753 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:04:39,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:04:39,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-31 22:04:39,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-31 22:04:39,965 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:40,198 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:04:40,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:04:40 BoogieIcfgContainer [2024-10-31 22:04:40,202 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:04:40,202 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:04:40,202 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:04:40,203 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:04:40,203 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:28" (3/4) ... [2024-10-31 22:04:40,206 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:04:40,207 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:04:40,208 INFO L158 Benchmark]: Toolchain (without parser) took 13595.48ms. Allocated memory was 142.6MB in the beginning and 287.3MB in the end (delta: 144.7MB). Free memory was 110.4MB in the beginning and 202.2MB in the end (delta: -91.8MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-10-31 22:04:40,209 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:04:40,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.09ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 91.3MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 22:04:40,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.36ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 85.3MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:04:40,210 INFO L158 Benchmark]: Boogie Preprocessor took 73.64ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 78.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:04:40,210 INFO L158 Benchmark]: RCFGBuilder took 1186.06ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 78.0MB in the beginning and 152.4MB in the end (delta: -74.3MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-10-31 22:04:40,211 INFO L158 Benchmark]: TraceAbstraction took 11592.40ms. Allocated memory was 199.2MB in the beginning and 287.3MB in the end (delta: 88.1MB). Free memory was 151.3MB in the beginning and 202.2MB in the end (delta: -50.9MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2024-10-31 22:04:40,211 INFO L158 Benchmark]: Witness Printer took 5.26ms. Allocated memory is still 287.3MB. Free memory is still 202.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:04:40,220 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.09ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 91.3MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.36ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 85.3MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.64ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 78.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1186.06ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 78.0MB in the beginning and 152.4MB in the end (delta: -74.3MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11592.40ms. Allocated memory was 199.2MB in the beginning and 287.3MB in the end (delta: 88.1MB). Free memory was 151.3MB in the beginning and 202.2MB in the end (delta: -50.9MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * Witness Printer took 5.26ms. Allocated memory is still 287.3MB. Free memory is still 202.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 202, overapproximation of shiftRight at line 107, overapproximation of bitwiseOr at line 116, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryDOUBLEComparisonOperation at line 202. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = -0.5; [L23] unsigned char var_1_2 = 0; [L24] float var_1_4 = 32.5; [L25] float var_1_5 = 10.25; [L26] float var_1_6 = 15.2; [L27] unsigned short int var_1_7 = 1; [L28] unsigned short int var_1_10 = 1; [L29] signed short int var_1_12 = 8; [L30] signed short int var_1_13 = -16; [L31] unsigned long int var_1_16 = 0; [L32] unsigned long int var_1_17 = 1790089366; [L33] unsigned long int var_1_18 = 1816612959; [L34] unsigned long int var_1_19 = 2; [L35] unsigned char var_1_20 = 32; [L36] unsigned char var_1_21 = 32; [L37] unsigned short int var_1_22 = 256; [L38] unsigned short int var_1_23 = 21380; [L39] signed char var_1_25 = 8; [L40] signed char var_1_26 = 0; [L41] signed char var_1_27 = 32; [L42] signed char var_1_28 = 32; [L43] double var_1_29 = 99999999.2; [L44] double var_1_31 = 64.25; [L45] double var_1_32 = 100.6; [L46] unsigned char var_1_33 = 0; [L47] unsigned char var_1_34 = 0; [L48] unsigned short int var_1_35 = 4; [L49] unsigned long int last_1_var_1_16 = 0; [L50] unsigned long int last_1_var_1_19 = 2; [L51] unsigned char last_1_var_1_20 = 32; [L52] signed char last_1_var_1_25 = 8; [L53] unsigned char last_1_var_1_33 = 0; VAL [isInitial=0, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L206] isInitial = 1 [L207] FCALL initially() [L208] int k_loop; [L209] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L209] COND TRUE k_loop < 1 [L210] CALL updateLastVariables() [L195] last_1_var_1_16 = var_1_16 [L196] last_1_var_1_19 = var_1_19 [L197] last_1_var_1_20 = var_1_20 [L198] last_1_var_1_25 = var_1_25 [L199] last_1_var_1_33 = var_1_33 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L149] var_1_2 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L150] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L151] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L151] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L152] var_1_4 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L153] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L154] var_1_5 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L155] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L156] var_1_6 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L157] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L158] var_1_10 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L159] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L160] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L160] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L161] var_1_12 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L162] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L163] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L163] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L164] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L164] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L165] var_1_17 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_17 >= 1610612735) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L166] RET assume_abort_if_not(var_1_17 >= 1610612735) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L167] CALL assume_abort_if_not(var_1_17 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L167] RET assume_abort_if_not(var_1_17 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L168] var_1_18 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_18 >= 1610612735) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L169] RET assume_abort_if_not(var_1_18 >= 1610612735) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L170] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L170] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L171] var_1_21 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L172] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L173] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L173] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L174] var_1_23 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_23 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L175] RET assume_abort_if_not(var_1_23 >= 16383) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L176] CALL assume_abort_if_not(var_1_23 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L176] RET assume_abort_if_not(var_1_23 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L177] var_1_26 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_26 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L178] RET assume_abort_if_not(var_1_26 >= -63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L179] CALL assume_abort_if_not(var_1_26 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L179] RET assume_abort_if_not(var_1_26 <= 63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L180] var_1_27 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L181] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L182] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L182] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L183] var_1_28 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L184] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L185] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L185] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L186] var_1_31 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L187] RET assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L188] var_1_32 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L189] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L190] var_1_34 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_35=4, var_1_7=1] [L191] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_35=4, var_1_7=1] [L192] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L192] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L211] RET updateVariables() [L212] CALL step() [L57] COND FALSE !(\read(last_1_var_1_33)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L66] COND TRUE var_1_6 == (- (99.4f * var_1_4)) [L67] var_1_25 = (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L75] EXPR var_1_10 & last_1_var_1_25 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L75] unsigned long int stepLocal_3 = last_1_var_1_16 * (var_1_10 & last_1_var_1_25); [L76] COND FALSE !(\read(last_1_var_1_33)) [L85] var_1_20 = 100 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L87] signed char stepLocal_2 = var_1_25; [L88] unsigned short int stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L89] COND TRUE stepLocal_2 <= last_1_var_1_16 [L90] var_1_16 = ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L96] unsigned long int stepLocal_5 = var_1_16; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_5=3808567485, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L97] COND FALSE !(var_1_18 >= stepLocal_5) [L104] var_1_29 = var_1_6 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=2, var_1_7=1] [L106] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR var_1_20 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR ((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR var_1_20 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR ((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] COND TRUE (var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)))) [L108] var_1_13 = 8 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L112] COND FALSE !(var_1_13 >= var_1_18) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L115] signed short int stepLocal_6 = var_1_13; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_6=8, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L116] EXPR var_1_20 ^ var_1_23 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_6=8, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L116] COND TRUE (var_1_20 ^ var_1_23) > stepLocal_6 [L117] COND TRUE ! (var_1_18 == (var_1_20 + var_1_7)) [L118] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L127] unsigned long int stepLocal_0 = var_1_19; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L128] COND FALSE !(\read(var_1_33)) [L135] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L137] unsigned char stepLocal_4 = var_1_20; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, stepLocal_4=100, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L138] COND FALSE !(stepLocal_4 < var_1_20) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L141] COND FALSE !(\read(var_1_33)) [L144] var_1_22 = 2 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L212] RET step() [L213] CALL, EXPR property() [L202] EXPR ((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25)))))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26)))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))) && ((var_1_18 >= var_1_16) ? (((- var_1_6) <= var_1_4) ? (var_1_29 == ((double) ((((var_1_5) > ((var_1_6 - var_1_4))) ? (var_1_5) : ((var_1_6 - var_1_4)))))) : (var_1_29 == ((double) (1.0000000000002E12 + ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_32)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_32))))))) : (var_1_29 == ((double) var_1_6)))) && (((var_1_20 ^ var_1_23) > var_1_13) ? ((! (var_1_18 == (var_1_20 + var_1_7))) ? (var_1_33 == ((unsigned char) var_1_34)) : 1) : (var_1_2 ? (var_1_33 == ((unsigned char) 0)) : (var_1_33 == ((unsigned char) var_1_34)))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202-L203] return ((((((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))) && ((var_1_18 >= var_1_16) ? (((- var_1_6) <= var_1_4) ? (var_1_29 == ((double) ((((var_1_5) > ((var_1_6 - var_1_4))) ? (var_1_5) : ((var_1_6 - var_1_4)))))) : (var_1_29 == ((double) (1.0000000000002E12 + ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_32)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_32))))))) : (var_1_29 == ((double) var_1_6)))) && (((var_1_20 ^ var_1_23) > var_1_13) ? ((! (var_1_18 == (var_1_20 + var_1_7))) ? (var_1_33 == ((unsigned char) var_1_34)) : 1) : (var_1_2 ? (var_1_33 == ((unsigned char) 0)) : (var_1_33 == ((unsigned char) var_1_34))))) && (var_1_35 == ((unsigned short int) var_1_7)) ; [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 11, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2453 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2450 mSDsluCounter, 4738 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2279 mSDsCounter, 380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 978 IncrementalHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 380 mSolverCounterUnsat, 2459 mSDtfsCounter, 978 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1042 GetRequests, 1008 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1664occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 1051 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2582 NumberOfCodeBlocks, 2582 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2363 ConstructedInterpolants, 0 QuantifiedInterpolants, 3525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 18024/18144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:04:40,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 161bb7a2aeb8f0e9fdffca01ff4293552e60c655d94a257edfbbb7105096b1f1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:04:42,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:04:43,082 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:04:43,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:04:43,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:04:43,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:04:43,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:04:43,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:04:43,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:04:43,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:04:43,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:04:43,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:04:43,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:04:43,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:04:43,124 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:04:43,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:04:43,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:04:43,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:04:43,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:04:43,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:04:43,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:04:43,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:04:43,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:04:43,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:04:43,135 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:04:43,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:04:43,135 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:04:43,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:04:43,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:04:43,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:04:43,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:04:43,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:04:43,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:04:43,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:04:43,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:43,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:04:43,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:04:43,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:04:43,142 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:04:43,142 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:04:43,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:04:43,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:04:43,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:04:43,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:04:43,154 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:04:43,156 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 161bb7a2aeb8f0e9fdffca01ff4293552e60c655d94a257edfbbb7105096b1f1 [2024-10-31 22:04:43,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:04:43,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:04:43,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:04:43,649 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:04:43,650 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:04:43,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i Unable to find full path for "g++" [2024-10-31 22:04:46,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:04:46,331 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:04:46,331 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i [2024-10-31 22:04:46,343 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/data/19bad9cd2/0400c35aa1524474b77e66d3beb5064a/FLAGb3673e1fd [2024-10-31 22:04:46,359 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/data/19bad9cd2/0400c35aa1524474b77e66d3beb5064a [2024-10-31 22:04:46,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:04:46,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:04:46,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:46,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:04:46,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:04:46,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:46,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578f5816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46, skipping insertion in model container [2024-10-31 22:04:46,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:46,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:04:46,643 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i[916,929] [2024-10-31 22:04:46,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:46,815 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:04:46,830 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-36.i[916,929] [2024-10-31 22:04:46,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:46,949 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:04:46,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46 WrapperNode [2024-10-31 22:04:46,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:46,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:46,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:04:46,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:04:46,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:46,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,028 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-10-31 22:04:47,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:47,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:04:47,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:04:47,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:04:47,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,096 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:04:47,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:04:47,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:04:47,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:04:47,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:04:47,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (1/1) ... [2024-10-31 22:04:47,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:47,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:47,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:04:47,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:04:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:04:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:04:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:04:47,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:04:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:04:47,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:04:47,371 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:04:47,373 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:04:53,278 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-31 22:04:53,278 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:04:53,319 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:04:53,319 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:04:53,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:53 BoogieIcfgContainer [2024-10-31 22:04:53,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:04:53,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:04:53,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:04:53,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:04:53,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:04:46" (1/3) ... [2024-10-31 22:04:53,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0d14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:53, skipping insertion in model container [2024-10-31 22:04:53,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:46" (2/3) ... [2024-10-31 22:04:53,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0d14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:53, skipping insertion in model container [2024-10-31 22:04:53,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:53" (3/3) ... [2024-10-31 22:04:53,338 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-36.i [2024-10-31 22:04:53,383 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:04:53,383 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:04:53,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:04:53,488 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@636edd4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:04:53,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:04:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 22:04:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-31 22:04:53,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:53,523 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:53,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:53,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash -349842121, now seen corresponding path program 1 times [2024-10-31 22:04:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:04:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869846759] [2024-10-31 22:04:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:53,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:04:53,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:04:53,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:04:53,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:04:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:54,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:04:54,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:04:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-10-31 22:04:54,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:04:54,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:04:54,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869846759] [2024-10-31 22:04:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869846759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:04:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251377998] [2024-10-31 22:04:54,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:54,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:04:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:04:54,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:04:54,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:04:54,386 INFO L87 Difference]: Start difference. First operand has 92 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-31 22:04:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:54,423 INFO L93 Difference]: Finished difference Result 181 states and 311 transitions. [2024-10-31 22:04:54,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:04:54,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-10-31 22:04:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:54,438 INFO L225 Difference]: With dead ends: 181 [2024-10-31 22:04:54,439 INFO L226 Difference]: Without dead ends: 88 [2024-10-31 22:04:54,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:04:54,447 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:54,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:04:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-31 22:04:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-31 22:04:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 22:04:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2024-10-31 22:04:54,499 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 183 [2024-10-31 22:04:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:54,500 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2024-10-31 22:04:54,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-31 22:04:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2024-10-31 22:04:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-31 22:04:54,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:54,505 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:54,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6ae5b5-ca75-4c2c-984e-5e8f92438921/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0