./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 153786ff23d1f4ad1fa22216334d8f153d923a58dff5067a8f60a9c72819150b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:13:01,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:13:01,465 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:13:01,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:13:01,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:13:01,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:13:01,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:13:01,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:13:01,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:13:01,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:13:01,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:13:01,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:13:01,503 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:13:01,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:13:01,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:13:01,505 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:13:01,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:13:01,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:13:01,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:13:01,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:13:01,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:13:01,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:13:01,509 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:13:01,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:13:01,510 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:13:01,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:13:01,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:13:01,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:13:01,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:13:01,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:13:01,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:13:01,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:13:01,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:13:01,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:13:01,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:13:01,516 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:13:01,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:13:01,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:13:01,517 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:13:01,517 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_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/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_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 153786ff23d1f4ad1fa22216334d8f153d923a58dff5067a8f60a9c72819150b [2023-11-06 22:13:01,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:13:01,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:13:01,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:13:01,892 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:13:01,892 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:13:01,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i [2023-11-06 22:13:05,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:13:05,386 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:13:05,387 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i [2023-11-06 22:13:05,407 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/data/df28c3096/95480af6935f4d19830c52a32b16950f/FLAG9a8dd0161 [2023-11-06 22:13:05,433 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/data/df28c3096/95480af6935f4d19830c52a32b16950f [2023-11-06 22:13:05,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:13:05,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:13:05,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:13:05,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:13:05,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:13:05,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:05,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787e65e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05, skipping insertion in model container [2023-11-06 22:13:05,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:05,516 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:13:05,755 WARN L240 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_4fccec9e-22df-4774-9720-f3a879219161/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i[916,929] [2023-11-06 22:13:05,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:13:05,865 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:13:05,881 WARN L240 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_4fccec9e-22df-4774-9720-f3a879219161/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i[916,929] [2023-11-06 22:13:05,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:13:05,975 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:13:05,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05 WrapperNode [2023-11-06 22:13:05,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:13:05,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:13:05,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:13:05,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:13:05,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,094 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2023-11-06 22:13:06,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:13:06,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:13:06,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:13:06,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:13:06,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:13:06,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:13:06,199 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:13:06,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:13:06,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (1/1) ... [2023-11-06 22:13:06,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:13:06,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:06,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:13:06,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:13:06,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:13:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:13:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:13:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:13:06,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:13:06,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:13:06,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:13:06,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:13:06,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:13:06,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:13:06,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:13:06,489 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:13:06,491 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:13:07,344 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:13:07,355 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:13:07,360 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:13:07,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:07 BoogieIcfgContainer [2023-11-06 22:13:07,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:13:07,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:13:07,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:13:07,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:13:07,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:13:05" (1/3) ... [2023-11-06 22:13:07,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2652eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:13:07, skipping insertion in model container [2023-11-06 22:13:07,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:05" (2/3) ... [2023-11-06 22:13:07,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2652eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:13:07, skipping insertion in model container [2023-11-06 22:13:07,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:07" (3/3) ... [2023-11-06 22:13:07,375 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-25.i [2023-11-06 22:13:07,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:13:07,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:13:07,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:13:07,489 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3135bffd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:13:07,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:13:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:13:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:13:07,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:07,518 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:07,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:07,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:07,524 INFO L85 PathProgramCache]: Analyzing trace with hash 751171573, now seen corresponding path program 1 times [2023-11-06 22:13:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068625386] [2023-11-06 22:13:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068625386] [2023-11-06 22:13:08,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068625386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:08,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:13:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752719527] [2023-11-06 22:13:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:08,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:13:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:08,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:13:08,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:13:08,236 INFO L87 Difference]: Start difference. First operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:13:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:08,294 INFO L93 Difference]: Finished difference Result 241 states and 378 transitions. [2023-11-06 22:13:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:13:08,296 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2023-11-06 22:13:08,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:08,307 INFO L225 Difference]: With dead ends: 241 [2023-11-06 22:13:08,308 INFO L226 Difference]: Without dead ends: 120 [2023-11-06 22:13:08,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:13:08,318 INFO L413 NwaCegarLoop]: 176 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, 176 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 [2023-11-06 22:13:08,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:13:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-06 22:13:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-06 22:13:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:13:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2023-11-06 22:13:08,377 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2023-11-06 22:13:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:08,378 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2023-11-06 22:13:08,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:13:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2023-11-06 22:13:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:13:08,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:08,385 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:08,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:13:08,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:08,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash -193959083, now seen corresponding path program 1 times [2023-11-06 22:13:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:08,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309523370] [2023-11-06 22:13:08,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:08,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:08,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309523370] [2023-11-06 22:13:08,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309523370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:08,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:08,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:13:08,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766984672] [2023-11-06 22:13:08,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:08,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:13:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:13:08,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:13:08,909 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:13:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:08,987 INFO L93 Difference]: Finished difference Result 243 states and 358 transitions. [2023-11-06 22:13:08,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:13:08,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2023-11-06 22:13:08,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:08,991 INFO L225 Difference]: With dead ends: 243 [2023-11-06 22:13:08,992 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:13:08,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:13:08,995 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:08,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 516 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:13:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:13:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2023-11-06 22:13:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:13:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2023-11-06 22:13:09,023 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 144 [2023-11-06 22:13:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:09,024 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2023-11-06 22:13:09,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:13:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2023-11-06 22:13:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:13:09,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:09,030 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:09,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:13:09,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:09,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:09,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1839434963, now seen corresponding path program 1 times [2023-11-06 22:13:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562640392] [2023-11-06 22:13:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:09,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:09,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562640392] [2023-11-06 22:13:09,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562640392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:09,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:09,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:13:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837757370] [2023-11-06 22:13:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:09,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:13:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:09,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:13:09,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:13:09,920 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:10,109 INFO L93 Difference]: Finished difference Result 245 states and 359 transitions. [2023-11-06 22:13:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:13:10,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2023-11-06 22:13:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:10,114 INFO L225 Difference]: With dead ends: 245 [2023-11-06 22:13:10,114 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:13:10,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:13:10,118 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 4 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:10,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 465 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:13:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:13:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2023-11-06 22:13:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:13:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 180 transitions. [2023-11-06 22:13:10,140 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 180 transitions. Word has length 144 [2023-11-06 22:13:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:10,142 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 180 transitions. [2023-11-06 22:13:10,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:10,142 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 180 transitions. [2023-11-06 22:13:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:13:10,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:10,147 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:10,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:13:10,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:10,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash 617914524, now seen corresponding path program 1 times [2023-11-06 22:13:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:10,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070946262] [2023-11-06 22:13:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:11,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:11,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070946262] [2023-11-06 22:13:11,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070946262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:11,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:11,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:13:11,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116052768] [2023-11-06 22:13:11,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:11,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:13:11,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:11,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:13:11,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:13:11,317 INFO L87 Difference]: Start difference. First operand 124 states and 180 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:11,929 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2023-11-06 22:13:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:13:11,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2023-11-06 22:13:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:11,941 INFO L225 Difference]: With dead ends: 326 [2023-11-06 22:13:11,941 INFO L226 Difference]: Without dead ends: 205 [2023-11-06 22:13:11,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:13:11,944 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 345 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:11,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 533 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:13:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-06 22:13:11,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 138. [2023-11-06 22:13:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 118 states have internal predecessors, (165), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:13:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2023-11-06 22:13:11,963 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 144 [2023-11-06 22:13:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:11,966 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2023-11-06 22:13:11,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2023-11-06 22:13:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-06 22:13:11,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:11,970 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:11,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:13:11,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:11,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:11,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2130781848, now seen corresponding path program 1 times [2023-11-06 22:13:11,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:11,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784392810] [2023-11-06 22:13:11,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:12,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:12,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784392810] [2023-11-06 22:13:12,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784392810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:12,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:12,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:13:12,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181279419] [2023-11-06 22:13:12,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:12,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:13:12,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:12,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:13:12,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:13:12,720 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:13,626 INFO L93 Difference]: Finished difference Result 390 states and 570 transitions. [2023-11-06 22:13:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:13:13,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2023-11-06 22:13:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:13,630 INFO L225 Difference]: With dead ends: 390 [2023-11-06 22:13:13,630 INFO L226 Difference]: Without dead ends: 255 [2023-11-06 22:13:13,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:13:13,632 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 315 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:13,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 464 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:13:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-06 22:13:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 223. [2023-11-06 22:13:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 194 states have (on average 1.407216494845361) internal successors, (273), 195 states have internal predecessors, (273), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:13:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 325 transitions. [2023-11-06 22:13:13,661 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 325 transitions. Word has length 145 [2023-11-06 22:13:13,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:13,662 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 325 transitions. [2023-11-06 22:13:13,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 325 transitions. [2023-11-06 22:13:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-06 22:13:13,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:13,667 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:13,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:13:13,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:13,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1579558446, now seen corresponding path program 1 times [2023-11-06 22:13:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:13,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222421674] [2023-11-06 22:13:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:13,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222421674] [2023-11-06 22:13:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222421674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:13,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:13,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:13:13,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041643622] [2023-11-06 22:13:13,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:13,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:13:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:13,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:13:13,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:13:13,959 INFO L87 Difference]: Start difference. First operand 223 states and 325 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:14,023 INFO L93 Difference]: Finished difference Result 503 states and 737 transitions. [2023-11-06 22:13:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:13:14,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2023-11-06 22:13:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:14,027 INFO L225 Difference]: With dead ends: 503 [2023-11-06 22:13:14,028 INFO L226 Difference]: Without dead ends: 283 [2023-11-06 22:13:14,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:13:14,029 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 93 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:14,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 745 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:13:14,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-11-06 22:13:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 227. [2023-11-06 22:13:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 198 states have (on average 1.398989898989899) internal successors, (277), 199 states have internal predecessors, (277), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:13:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 329 transitions. [2023-11-06 22:13:14,055 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 329 transitions. Word has length 146 [2023-11-06 22:13:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:14,056 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 329 transitions. [2023-11-06 22:13:14,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 329 transitions. [2023-11-06 22:13:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-06 22:13:14,059 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:14,059 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:14,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:13:14,060 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:14,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:14,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1081166141, now seen corresponding path program 1 times [2023-11-06 22:13:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:14,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605342395] [2023-11-06 22:13:14,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:15,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:15,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:15,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:15,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:15,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:16,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605342395] [2023-11-06 22:13:16,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605342395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:16,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:16,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:13:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498753157] [2023-11-06 22:13:16,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:16,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:13:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:16,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:13:16,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:13:16,049 INFO L87 Difference]: Start difference. First operand 227 states and 329 transitions. Second operand has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:17,635 INFO L93 Difference]: Finished difference Result 581 states and 843 transitions. [2023-11-06 22:13:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:13:17,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2023-11-06 22:13:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:17,640 INFO L225 Difference]: With dead ends: 581 [2023-11-06 22:13:17,640 INFO L226 Difference]: Without dead ends: 357 [2023-11-06 22:13:17,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:13:17,642 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 717 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:17,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 519 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:13:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-11-06 22:13:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 227. [2023-11-06 22:13:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 198 states have (on average 1.393939393939394) internal successors, (276), 199 states have internal predecessors, (276), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:13:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2023-11-06 22:13:17,681 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 147 [2023-11-06 22:13:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:17,682 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2023-11-06 22:13:17,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2023-11-06 22:13:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:13:17,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:17,685 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:17,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:13:17,686 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:17,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:17,687 INFO L85 PathProgramCache]: Analyzing trace with hash -48930317, now seen corresponding path program 1 times [2023-11-06 22:13:17,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:17,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530723486] [2023-11-06 22:13:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:17,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:19,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530723486] [2023-11-06 22:13:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530723486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:19,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:19,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:13:19,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512041224] [2023-11-06 22:13:19,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:19,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:13:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:19,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:13:19,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:13:19,609 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:20,978 INFO L93 Difference]: Finished difference Result 545 states and 788 transitions. [2023-11-06 22:13:20,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:13:20,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 148 [2023-11-06 22:13:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:20,982 INFO L225 Difference]: With dead ends: 545 [2023-11-06 22:13:20,982 INFO L226 Difference]: Without dead ends: 321 [2023-11-06 22:13:20,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:13:20,984 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 524 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:20,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 528 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:13:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-06 22:13:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 227. [2023-11-06 22:13:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 198 states have (on average 1.3888888888888888) internal successors, (275), 199 states have internal predecessors, (275), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:13:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 327 transitions. [2023-11-06 22:13:21,021 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 327 transitions. Word has length 148 [2023-11-06 22:13:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:21,022 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 327 transitions. [2023-11-06 22:13:21,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 327 transitions. [2023-11-06 22:13:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:13:21,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:21,025 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:21,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:13:21,025 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:21,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash 584862378, now seen corresponding path program 1 times [2023-11-06 22:13:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594193115] [2023-11-06 22:13:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:21,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:21,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594193115] [2023-11-06 22:13:21,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594193115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:21,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:21,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:13:21,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710543377] [2023-11-06 22:13:21,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:21,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:13:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:21,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:13:21,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:13:21,829 INFO L87 Difference]: Start difference. First operand 227 states and 327 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:22,499 INFO L93 Difference]: Finished difference Result 485 states and 698 transitions. [2023-11-06 22:13:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:13:22,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2023-11-06 22:13:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:22,505 INFO L225 Difference]: With dead ends: 485 [2023-11-06 22:13:22,505 INFO L226 Difference]: Without dead ends: 261 [2023-11-06 22:13:22,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:13:22,509 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 267 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:22,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 395 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:13:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-06 22:13:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 230. [2023-11-06 22:13:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 202 states have internal predecessors, (278), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:13:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 330 transitions. [2023-11-06 22:13:22,554 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 330 transitions. Word has length 148 [2023-11-06 22:13:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:22,558 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 330 transitions. [2023-11-06 22:13:22,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 330 transitions. [2023-11-06 22:13:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:13:22,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:22,562 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:22,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:13:22,562 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:22,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash 885497077, now seen corresponding path program 1 times [2023-11-06 22:13:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:22,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248182972] [2023-11-06 22:13:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:13:24,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:24,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248182972] [2023-11-06 22:13:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248182972] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:24,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524273984] [2023-11-06 22:13:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:24,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:24,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:24,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:24,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:13:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-06 22:13:24,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:25,456 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:13:25,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:25,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:13:25,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:25,956 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:13:26,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:26,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:13:26,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:26,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:13:26,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:26,550 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:13:26,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:26,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:13:26,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:26,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:13:26,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-11-06 22:13:27,018 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-06 22:13:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 472 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-11-06 22:13:27,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:27,129 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_621) |c_~#BOOL_unsigned_char_Array_0~0.base|) (+ 1 |c_~#BOOL_unsigned_char_Array_0~0.offset|)))) (< .cse0 (+ (* 256 (div (+ (- 1) .cse0) 256)) 256)))) is different from false [2023-11-06 22:13:27,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524273984] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:27,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:13:27,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-06 22:13:27,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054447011] [2023-11-06 22:13:27,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:27,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 22:13:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:27,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 22:13:27,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=312, Unknown=1, NotChecked=36, Total=420 [2023-11-06 22:13:27,151 INFO L87 Difference]: Start difference. First operand 230 states and 330 transitions. Second operand has 20 states, 17 states have (on average 6.705882352941177) internal successors, (114), 20 states have internal predecessors, (114), 11 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 8 states have call predecessors, (36), 11 states have call successors, (36) [2023-11-06 22:13:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:29,425 INFO L93 Difference]: Finished difference Result 703 states and 991 transitions. [2023-11-06 22:13:29,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 22:13:29,426 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.705882352941177) internal successors, (114), 20 states have internal predecessors, (114), 11 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 8 states have call predecessors, (36), 11 states have call successors, (36) Word has length 148 [2023-11-06 22:13:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:29,431 INFO L225 Difference]: With dead ends: 703 [2023-11-06 22:13:29,431 INFO L226 Difference]: Without dead ends: 476 [2023-11-06 22:13:29,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 222 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=377, Invalid=1266, Unknown=1, NotChecked=78, Total=1722 [2023-11-06 22:13:29,437 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 898 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:29,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 526 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 22:13:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2023-11-06 22:13:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 455. [2023-11-06 22:13:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 392 states have (on average 1.364795918367347) internal successors, (535), 395 states have internal predecessors, (535), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-06 22:13:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 639 transitions. [2023-11-06 22:13:29,535 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 639 transitions. Word has length 148 [2023-11-06 22:13:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:29,536 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 639 transitions. [2023-11-06 22:13:29,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.705882352941177) internal successors, (114), 20 states have internal predecessors, (114), 11 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 8 states have call predecessors, (36), 11 states have call successors, (36) [2023-11-06 22:13:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 639 transitions. [2023-11-06 22:13:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-06 22:13:29,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:29,540 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:29,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:13:29,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:13:29,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:29,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:29,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1051293201, now seen corresponding path program 1 times [2023-11-06 22:13:29,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:29,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386187653] [2023-11-06 22:13:29,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:29,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:13:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:13:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:13:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:30,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:30,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386187653] [2023-11-06 22:13:30,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386187653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:30,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:30,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:13:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906392603] [2023-11-06 22:13:30,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:30,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:13:30,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:30,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:13:30,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:13:30,531 INFO L87 Difference]: Start difference. First operand 455 states and 639 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:31,193 INFO L93 Difference]: Finished difference Result 901 states and 1264 transitions. [2023-11-06 22:13:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:13:31,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2023-11-06 22:13:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:31,198 INFO L225 Difference]: With dead ends: 901 [2023-11-06 22:13:31,198 INFO L226 Difference]: Without dead ends: 449 [2023-11-06 22:13:31,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:13:31,200 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 366 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:31,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 273 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:13:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-11-06 22:13:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 445. [2023-11-06 22:13:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 382 states have (on average 1.3586387434554974) internal successors, (519), 385 states have internal predecessors, (519), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-06 22:13:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 623 transitions. [2023-11-06 22:13:31,271 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 623 transitions. Word has length 149 [2023-11-06 22:13:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:31,271 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 623 transitions. [2023-11-06 22:13:31,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 623 transitions. [2023-11-06 22:13:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-06 22:13:31,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:31,275 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:31,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:13:31,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:31,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1585696824, now seen corresponding path program 1 times [2023-11-06 22:13:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:31,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150374367] [2023-11-06 22:13:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:31,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:13:31,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:13:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:13:31,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:13:31,561 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:13:31,562 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:13:31,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:13:31,567 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:31,571 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:13:31,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:13:31 BoogieIcfgContainer [2023-11-06 22:13:31,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:13:31,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:13:31,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:13:31,715 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:13:31,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:07" (3/4) ... [2023-11-06 22:13:31,717 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:13:31,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:13:31,719 INFO L158 Benchmark]: Toolchain (without parser) took 26274.46ms. Allocated memory was 163.6MB in the beginning and 423.6MB in the end (delta: 260.0MB). Free memory was 117.4MB in the beginning and 178.9MB in the end (delta: -61.6MB). Peak memory consumption was 200.7MB. Max. memory is 16.1GB. [2023-11-06 22:13:31,719 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:13:31,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.66ms. Allocated memory is still 163.6MB. Free memory was 117.4MB in the beginning and 101.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:13:31,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.46ms. Allocated memory is still 163.6MB. Free memory was 101.1MB in the beginning and 97.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:13:31,720 INFO L158 Benchmark]: Boogie Preprocessor took 102.24ms. Allocated memory is still 163.6MB. Free memory was 97.0MB in the beginning and 93.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:13:31,721 INFO L158 Benchmark]: RCFGBuilder took 1165.13ms. Allocated memory is still 163.6MB. Free memory was 93.7MB in the beginning and 117.7MB in the end (delta: -24.0MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2023-11-06 22:13:31,722 INFO L158 Benchmark]: TraceAbstraction took 24347.26ms. Allocated memory was 163.6MB in the beginning and 423.6MB in the end (delta: 260.0MB). Free memory was 116.7MB in the beginning and 180.0MB in the end (delta: -63.2MB). Peak memory consumption was 199.8MB. Max. memory is 16.1GB. [2023-11-06 22:13:31,722 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 423.6MB. Free memory was 180.0MB in the beginning and 178.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:13:31,726 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.32ms. Allocated memory is still 117.4MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.66ms. Allocated memory is still 163.6MB. Free memory was 117.4MB in the beginning and 101.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.46ms. Allocated memory is still 163.6MB. Free memory was 101.1MB in the beginning and 97.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.24ms. Allocated memory is still 163.6MB. Free memory was 97.0MB in the beginning and 93.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1165.13ms. Allocated memory is still 163.6MB. Free memory was 93.7MB in the beginning and 117.7MB in the end (delta: -24.0MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24347.26ms. Allocated memory was 163.6MB in the beginning and 423.6MB in the end (delta: 260.0MB). Free memory was 116.7MB in the beginning and 180.0MB in the end (delta: -63.2MB). Peak memory consumption was 199.8MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 423.6MB. Free memory was 180.0MB in the beginning and 178.9MB in the end (delta: 1.0MB). 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 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 0} }; [L25-L27] float float_Array_0[2][2] = { {63.363, 128.9}, {4.575, 25.5} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2] = { {10, 0}, {1509114200, 256} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 500, 10 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][0]=513, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][0]=513, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][0]=513, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][0]=513, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][1]=257, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][1]=257, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][1]=257, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][1]=257, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][1]=-255, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][1]=-255, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][1]=-255, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][1]=-255, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] float_Array_0[0][0] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0][0] [L79] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L79] EXPR float_Array_0[0][0] [L79] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[0][0]=1509114225, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [(float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F=1, float_Array_0[0][0]=1509114225, float_Array_0[0][0]=1509114225, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [(float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F=1, float_Array_0[0][0]=1509114225, float_Array_0[0][0]=1509114225, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] float_Array_0[1][0] = __VERIFIER_nondet_float() [L81] EXPR float_Array_0[1][0] [L81] EXPR float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F [L81] EXPR float_Array_0[1][0] [L81] EXPR float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[1][0]=1509114219, float_Array_0[1][0]=1509114219, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR (float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854765600e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [(float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854765600e+12F && float_Array_0[1][0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F=1, float_Array_0[1][0]=1509114219, float_Array_0[1][0]=1509114219, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854765600e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854765600e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [(float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854765600e+12F && float_Array_0[1][0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F=1, float_Array_0[1][0]=1509114219, float_Array_0[1][0]=1509114219, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L83] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_short_int_Array_0={7:0}] [L84] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_short_int_Array_0={7:0}] [L85] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L86] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_short_int_Array_0={7:0}] [L87] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_short_int_Array_0={7:0}] [L88] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][1]=1073741823, unsigned_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][1]=1073741823, unsigned_short_int_Array_0={7:0}] [L90] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][1]=1073741823, unsigned_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][1]=1073741823, unsigned_short_int_Array_0={7:0}] [L91] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1] [L93] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1] [L94] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[1]=65538] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[1]=65538] [L96] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[1]=65538] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[1]=65538] [L109] RET updateVariables() [L110] CALL step() [L37] EXPR float_Array_0[0][0] [L37] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] COND FALSE !(float_Array_0[0][0] != float_Array_0[1][0]) [L44] EXPR BOOL_unsigned_char_Array_0[0][1] [L44] BOOL_unsigned_char_Array_0[0][0] = BOOL_unsigned_char_Array_0[0][1] [L46] EXPR unsigned_short_int_Array_0[1] [L46] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[1]; [L47] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, isInitial=1, stepLocal_0=2, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L47] COND TRUE BOOL_unsigned_char_Array_0[0][0] [L48] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, stepLocal_0=2, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1] [L48] COND FALSE !(stepLocal_0 <= unsigned_short_int_Array_0[0]) [L54] EXPR unsigned_long_int_Array_0[1][1] [L54] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[1][1]; [L55] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, stepLocal_0=2, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_short_int_Array_0={7:0}] [L55] COND FALSE !(unsigned_long_int_Array_0[0][0] >= stepLocal_1) [L58] EXPR float_Array_0[0][0] [L58] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, stepLocal_0=2, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L58] EXPR ((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]) [L58] EXPR float_Array_0[0][0] [L58] EXPR ((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]) VAL [((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])=1509114225, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[0][0]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, stepLocal_0=2, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L58] float_Array_0[0][1] = ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))) [L60] EXPR float_Array_0[1][0] [L60] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, stepLocal_0=2, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR ((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0]) VAL [((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])=5127/40, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, stepLocal_0=2, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR float_Array_0[0][1] VAL [((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])=5127/40, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[0][1]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, stepLocal_0=2, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR ((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1]) [L60] EXPR float_Array_0[0][1] [L60] EXPR ((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1]) VAL [((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])=1509114225, ((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])=5127/40, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[0][1]=1509114225, float_Array_0[0][1]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, stepLocal_0=2, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] COND TRUE float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1]))) [L61] EXPR float_Array_0[1][0] [L61] float_Array_0[1][1] = float_Array_0[1][0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0])) [L101] EXPR unsigned_short_int_Array_0[1] [L101] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1, unsigned_short_int_Array_0[1]=65538] [L101] EXPR (unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1 VAL [(unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1, unsigned_short_int_Array_0[1]=65538] [L101] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0])) VAL [(unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))=1, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1, unsigned_short_int_Array_0[1]=65538] [L101] EXPR (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])))))) [L101] EXPR unsigned_long_int_Array_0[0][0] [L101] EXPR unsigned_long_int_Array_0[1][1] VAL [(BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))=1, (unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))=1, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_long_int_Array_0[1][1]=256, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1, unsigned_short_int_Array_0[1]=65538] [L101] EXPR (unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))) [L101] EXPR float_Array_0[0][1] [L101] EXPR float_Array_0[0][0] [L101] EXPR float_Array_0[1][0] VAL [(BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))=1, (unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))=1, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[0][1]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_long_int_Array_0[1][1]=256, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1, unsigned_short_int_Array_0[1]=65538] [L101] EXPR ((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]) [L101] EXPR float_Array_0[0][0] [L101] EXPR ((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]) VAL [((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])=1509114225, (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))=1, (unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))=1, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[0][0]=1509114225, float_Array_0[0][1]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_long_int_Array_0[1][1]=256, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1, unsigned_short_int_Array_0[1]=65538] [L101] EXPR (unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))) VAL [((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])=1509114225, (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))=1, (unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])))))=0, (unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))=1, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[0][0]=1509114225, float_Array_0[0][1]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_long_int_Array_0[1][1]=256, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1, unsigned_short_int_Array_0[1]=65538] [L101] EXPR (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])))))) VAL [((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])=1509114225, (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))=0, (unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])))))=0, (unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))=1, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[0][0]=1509114225, float_Array_0[0][1]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_long_int_Array_0[1][1]=256, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1, unsigned_short_int_Array_0[1]=65538] [L101] EXPR ((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1)) VAL [((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1))=0, ((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])=1509114225, (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))=0, (unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])))))=0, (unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))=1, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[0][0]=1509114225, float_Array_0[0][1]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_long_int_Array_0[1][1]=256, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1, unsigned_short_int_Array_0[1]=65538] [L101] EXPR (((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1))) && ((float_Array_0[0][0] != float_Array_0[1][0]) ? ((BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) VAL [(((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1))) && ((float_Array_0[0][0] != float_Array_0[1][0]) ? ((BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))=0, ((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1))=0, ((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])=1509114225, (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))=0, (unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])))))=0, (unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))=1, BOOL_unsigned_char_Array_0[0][0]=257, float_Array_0={5:0}, float_Array_0[0][0]=1509114225, float_Array_0[0][0]=1509114225, float_Array_0[0][1]=1509114225, float_Array_0[1][0]=1509114219, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_long_int_Array_0[0][0]=9, unsigned_long_int_Array_0[1][1]=256, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0[0]=1, unsigned_short_int_Array_0[1]=65538] [L101-L102] return (((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1))) && ((float_Array_0[0][0] != float_Array_0[1][0]) ? ((BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.1s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3558 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3539 mSDsluCounter, 5140 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3529 mSDsCounter, 580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4894 IncrementalHoareTripleChecker+Invalid, 5474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 580 mSolverCounterUnsat, 1611 mSDtfsCounter, 4894 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 760 GetRequests, 647 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=455occurred in iteration=10, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 441 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 1906 NumberOfCodeBlocks, 1906 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1743 ConstructedInterpolants, 0 QuantifiedInterpolants, 9264 SizeOfPredicates, 8 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 6827/7344 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 [2023-11-06 22:13:31,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 153786ff23d1f4ad1fa22216334d8f153d923a58dff5067a8f60a9c72819150b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:13:34,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:13:34,517 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:13:34,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:13:34,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:13:34,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:13:34,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:13:34,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:13:34,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:13:34,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:13:34,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:13:34,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:13:34,578 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:13:34,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:13:34,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:13:34,581 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:13:34,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:13:34,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:13:34,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:13:34,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:13:34,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:13:34,585 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:13:34,585 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:13:34,585 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:13:34,586 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:13:34,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:13:34,587 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:13:34,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:13:34,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:13:34,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:13:34,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:13:34,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:13:34,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:13:34,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:13:34,591 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:13:34,591 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:13:34,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:13:34,592 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:13:34,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:13:34,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:13:34,593 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:13:34,594 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:13:34,594 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_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/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_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 153786ff23d1f4ad1fa22216334d8f153d923a58dff5067a8f60a9c72819150b [2023-11-06 22:13:35,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:13:35,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:13:35,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:13:35,041 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:13:35,042 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:13:35,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i [2023-11-06 22:13:38,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:13:38,488 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:13:38,488 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i [2023-11-06 22:13:38,498 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/data/6eea19dfe/ab55d446b0254406b7743e0d73a1de25/FLAGe653ecb09 [2023-11-06 22:13:38,523 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/data/6eea19dfe/ab55d446b0254406b7743e0d73a1de25 [2023-11-06 22:13:38,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:13:38,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:13:38,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:13:38,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:13:38,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:13:38,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:38" (1/1) ... [2023-11-06 22:13:38,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7adc185f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:38, skipping insertion in model container [2023-11-06 22:13:38,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:38" (1/1) ... [2023-11-06 22:13:38,592 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:13:38,812 WARN L240 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_4fccec9e-22df-4774-9720-f3a879219161/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i[916,929] [2023-11-06 22:13:38,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:13:38,952 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:13:38,969 WARN L240 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_4fccec9e-22df-4774-9720-f3a879219161/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i[916,929] [2023-11-06 22:13:39,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:13:39,168 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:13:39,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39 WrapperNode [2023-11-06 22:13:39,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:13:39,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:13:39,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:13:39,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:13:39,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,268 INFO L138 Inliner]: procedures = 36, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2023-11-06 22:13:39,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:13:39,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:13:39,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:13:39,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:13:39,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:13:39,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:13:39,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:13:39,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:13:39,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (1/1) ... [2023-11-06 22:13:39,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:13:39,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:39,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:13:39,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:13:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:13:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:13:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:13:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:13:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:13:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:13:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:13:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:13:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:13:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:13:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:13:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:13:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:13:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:13:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:13:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:13:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:13:39,591 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:13:39,593 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:13:40,473 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:13:40,482 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:13:40,482 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:13:40,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:40 BoogieIcfgContainer [2023-11-06 22:13:40,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:13:40,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:13:40,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:13:40,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:13:40,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:13:38" (1/3) ... [2023-11-06 22:13:40,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1562a77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:13:40, skipping insertion in model container [2023-11-06 22:13:40,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:39" (2/3) ... [2023-11-06 22:13:40,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1562a77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:13:40, skipping insertion in model container [2023-11-06 22:13:40,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:40" (3/3) ... [2023-11-06 22:13:40,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-25.i [2023-11-06 22:13:40,517 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:13:40,517 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:13:40,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:13:40,587 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@407c37b4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:13:40,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:13:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:13:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:13:40,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:40,640 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:40,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:40,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1269082004, now seen corresponding path program 1 times [2023-11-06 22:13:40,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:13:40,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203900759] [2023-11-06 22:13:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:40,673 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 [2023-11-06 22:13:40,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:13:40,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:13:40,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:13:41,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/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)] Ended with exit code 139 [2023-11-06 22:13:41,122 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 22:13:41,128 INFO L158 Benchmark]: Toolchain (without parser) took 2595.05ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 55.1MB in the beginning and 52.6MB in the end (delta: 2.5MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2023-11-06 22:13:41,129 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 58.7MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:13:41,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.42ms. Allocated memory is still 79.7MB. Free memory was 55.0MB in the beginning and 56.8MB in the end (delta: -1.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:13:41,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.80ms. Allocated memory is still 79.7MB. Free memory was 56.8MB in the beginning and 52.8MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:13:41,131 INFO L158 Benchmark]: Boogie Preprocessor took 73.28ms. Allocated memory is still 79.7MB. Free memory was 52.8MB in the beginning and 48.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:13:41,132 INFO L158 Benchmark]: RCFGBuilder took 1142.18ms. Allocated memory is still 79.7MB. Free memory was 48.9MB in the beginning and 36.7MB in the end (delta: 12.2MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-11-06 22:13:41,133 INFO L158 Benchmark]: TraceAbstraction took 638.60ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 35.9MB in the beginning and 52.6MB in the end (delta: -16.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:13:41,136 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.26ms. Allocated memory is still 58.7MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.42ms. Allocated memory is still 79.7MB. Free memory was 55.0MB in the beginning and 56.8MB in the end (delta: -1.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.80ms. Allocated memory is still 79.7MB. Free memory was 56.8MB in the beginning and 52.8MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.28ms. Allocated memory is still 79.7MB. Free memory was 52.8MB in the beginning and 48.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1142.18ms. Allocated memory is still 79.7MB. Free memory was 48.9MB in the beginning and 36.7MB in the end (delta: 12.2MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 638.60ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 35.9MB in the beginning and 52.6MB in the end (delta: -16.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:13:41,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fccec9e-22df-4774-9720-f3a879219161/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.