./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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 a08177a217967a14ae274e8c5e7353d301abaa21d3437088fff2fbb57c26aa06 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:39:38,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:39:38,965 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:39:38,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:39:38,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:39:39,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:39:39,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:39:39,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:39:39,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:39:39,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:39:39,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:39:39,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:39:39,024 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:39:39,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:39:39,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:39:39,027 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:39:39,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:39:39,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:39:39,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:39:39,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:39:39,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:39:39,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:39:39,031 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:39:39,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:39:39,032 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:39:39,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:39:39,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:39:39,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:39:39,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:39,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:39:39,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:39:39,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:39:39,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:39:39,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:39:39,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:39:39,038 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:39:39,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:39:39,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:39:39,039 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:39:39,040 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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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 -> a08177a217967a14ae274e8c5e7353d301abaa21d3437088fff2fbb57c26aa06 [2023-11-06 22:39:39,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:39:39,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:39:39,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:39:39,416 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:39:39,417 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:39:39,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i [2023-11-06 22:39:42,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:39:42,719 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:39:42,720 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i [2023-11-06 22:39:42,730 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/data/7bf32caa7/d78a9338db9c44aebd812a0ab4d4fe95/FLAGf55acb744 [2023-11-06 22:39:42,747 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/data/7bf32caa7/d78a9338db9c44aebd812a0ab4d4fe95 [2023-11-06 22:39:42,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:39:42,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:39:42,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:42,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:39:42,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:39:42,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:42" (1/1) ... [2023-11-06 22:39:42,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d336df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:42, skipping insertion in model container [2023-11-06 22:39:42,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:42" (1/1) ... [2023-11-06 22:39:42,811 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:43,025 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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i[916,929] [2023-11-06 22:39:43,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:43,155 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:39:43,174 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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i[916,929] [2023-11-06 22:39:43,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:43,252 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:39:43,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43 WrapperNode [2023-11-06 22:39:43,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:43,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:43,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:39:43,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:39:43,264 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:39:43" (1/1) ... [2023-11-06 22:39:43,280 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:39:43" (1/1) ... [2023-11-06 22:39:43,337 INFO L138 Inliner]: procedures = 29, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 389 [2023-11-06 22:39:43,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:43,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:39:43,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:39:43,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:39:43,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43" (1/1) ... [2023-11-06 22:39:43,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43" (1/1) ... [2023-11-06 22:39:43,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43" (1/1) ... [2023-11-06 22:39:43,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43" (1/1) ... [2023-11-06 22:39:43,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43" (1/1) ... [2023-11-06 22:39:43,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43" (1/1) ... [2023-11-06 22:39:43,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43" (1/1) ... [2023-11-06 22:39:43,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43" (1/1) ... [2023-11-06 22:39:43,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:39:43,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:39:43,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:39:43,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:39:43,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43" (1/1) ... [2023-11-06 22:39:43,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:43,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:43,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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:39:43,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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:39:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:39:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:39:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:39:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:39:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:39:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:39:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:39:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:39:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:39:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:39:43,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:39:43,611 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:39:43,614 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:39:44,260 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:39:44,269 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:39:44,270 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:39:44,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:44 BoogieIcfgContainer [2023-11-06 22:39:44,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:39:44,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:39:44,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:39:44,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:39:44,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:39:42" (1/3) ... [2023-11-06 22:39:44,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c431af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:44, skipping insertion in model container [2023-11-06 22:39:44,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:43" (2/3) ... [2023-11-06 22:39:44,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c431af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:44, skipping insertion in model container [2023-11-06 22:39:44,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:44" (3/3) ... [2023-11-06 22:39:44,292 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-55.i [2023-11-06 22:39:44,315 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:39:44,315 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:39:44,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:39:44,382 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;@1cc4208e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:39:44,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:39:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:39:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 22:39:44,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:44,405 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:44,406 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:44,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:44,412 INFO L85 PathProgramCache]: Analyzing trace with hash -710735374, now seen corresponding path program 1 times [2023-11-06 22:39:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:44,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097638867] [2023-11-06 22:39:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:44,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:44,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:44,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097638867] [2023-11-06 22:39:44,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097638867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:44,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:44,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:39:44,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918166400] [2023-11-06 22:39:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:44,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:39:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:45,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:39:45,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:39:45,003 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:39:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:45,043 INFO L93 Difference]: Finished difference Result 207 states and 322 transitions. [2023-11-06 22:39:45,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:39:45,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-11-06 22:39:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:45,055 INFO L225 Difference]: With dead ends: 207 [2023-11-06 22:39:45,055 INFO L226 Difference]: Without dead ends: 103 [2023-11-06 22:39:45,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:39:45,063 INFO L413 NwaCegarLoop]: 151 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, 151 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:39:45,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:45,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-06 22:39:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-06 22:39:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:39:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2023-11-06 22:39:45,148 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 115 [2023-11-06 22:39:45,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:45,150 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2023-11-06 22:39:45,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:39:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2023-11-06 22:39:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 22:39:45,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:45,154 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:45,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:39:45,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:45,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1857949026, now seen corresponding path program 1 times [2023-11-06 22:39:45,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:45,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540488917] [2023-11-06 22:39:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:45,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540488917] [2023-11-06 22:39:45,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540488917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:45,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:45,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:39:45,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894669948] [2023-11-06 22:39:45,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:45,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:39:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:39:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:45,771 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:45,870 INFO L93 Difference]: Finished difference Result 215 states and 316 transitions. [2023-11-06 22:39:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:39:45,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-06 22:39:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:45,880 INFO L225 Difference]: With dead ends: 215 [2023-11-06 22:39:45,882 INFO L226 Difference]: Without dead ends: 115 [2023-11-06 22:39:45,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:39:45,886 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 21 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:45,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 440 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-06 22:39:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2023-11-06 22:39:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:39:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2023-11-06 22:39:45,916 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 115 [2023-11-06 22:39:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:45,920 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2023-11-06 22:39:45,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2023-11-06 22:39:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 22:39:45,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:45,929 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:45,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:39:45,930 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:45,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1756959900, now seen corresponding path program 1 times [2023-11-06 22:39:45,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:45,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675346297] [2023-11-06 22:39:45,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:45,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:46,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:46,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675346297] [2023-11-06 22:39:46,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675346297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:46,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:46,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:39:46,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813864201] [2023-11-06 22:39:46,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:46,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:39:46,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:46,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:39:46,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:46,258 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:46,318 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2023-11-06 22:39:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:39:46,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-06 22:39:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:46,324 INFO L225 Difference]: With dead ends: 215 [2023-11-06 22:39:46,324 INFO L226 Difference]: Without dead ends: 113 [2023-11-06 22:39:46,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:39:46,332 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 438 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:39:46,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 438 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-06 22:39:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2023-11-06 22:39:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:39:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-11-06 22:39:46,355 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 115 [2023-11-06 22:39:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:46,357 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-11-06 22:39:46,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-11-06 22:39:46,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 22:39:46,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:46,361 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:46,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:39:46,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:46,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:46,362 INFO L85 PathProgramCache]: Analyzing trace with hash 18047462, now seen corresponding path program 1 times [2023-11-06 22:39:46,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:46,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673203313] [2023-11-06 22:39:46,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:46,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673203313] [2023-11-06 22:39:46,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673203313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:46,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:46,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:39:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608418080] [2023-11-06 22:39:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:46,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:39:46,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:46,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:39:46,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:46,537 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:46,553 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2023-11-06 22:39:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:39:46,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-06 22:39:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:46,555 INFO L225 Difference]: With dead ends: 211 [2023-11-06 22:39:46,556 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:39:46,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:46,557 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:46,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 289 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:39:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-06 22:39:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:39:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2023-11-06 22:39:46,568 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 115 [2023-11-06 22:39:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:46,569 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2023-11-06 22:39:46,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2023-11-06 22:39:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 22:39:46,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:46,571 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:46,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:39:46,571 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:46,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash 810511649, now seen corresponding path program 1 times [2023-11-06 22:39:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:46,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319937280] [2023-11-06 22:39:46,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319937280] [2023-11-06 22:39:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319937280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:47,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:47,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:39:47,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534033919] [2023-11-06 22:39:47,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:47,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:39:47,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:47,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:39:47,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:47,385 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:47,852 INFO L93 Difference]: Finished difference Result 366 states and 527 transitions. [2023-11-06 22:39:47,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:39:47,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-11-06 22:39:47,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:47,856 INFO L225 Difference]: With dead ends: 366 [2023-11-06 22:39:47,856 INFO L226 Difference]: Without dead ends: 262 [2023-11-06 22:39:47,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:39:47,858 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 212 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:47,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 456 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:39:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-06 22:39:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 166. [2023-11-06 22:39:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 139 states have (on average 1.3884892086330936) internal successors, (193), 139 states have internal predecessors, (193), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:39:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 241 transitions. [2023-11-06 22:39:47,891 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 241 transitions. Word has length 117 [2023-11-06 22:39:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:47,892 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 241 transitions. [2023-11-06 22:39:47,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 241 transitions. [2023-11-06 22:39:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 22:39:47,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:47,895 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:47,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:39:47,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:47,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:47,896 INFO L85 PathProgramCache]: Analyzing trace with hash -994926685, now seen corresponding path program 1 times [2023-11-06 22:39:47,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:47,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500614586] [2023-11-06 22:39:47,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:47,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:48,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500614586] [2023-11-06 22:39:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500614586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:48,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:39:48,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665655419] [2023-11-06 22:39:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:48,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:39:48,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:48,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:39:48,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:39:48,913 INFO L87 Difference]: Start difference. First operand 166 states and 241 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:49,549 INFO L93 Difference]: Finished difference Result 366 states and 526 transitions. [2023-11-06 22:39:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:39:49,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-11-06 22:39:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:49,553 INFO L225 Difference]: With dead ends: 366 [2023-11-06 22:39:49,553 INFO L226 Difference]: Without dead ends: 262 [2023-11-06 22:39:49,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:39:49,555 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 367 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:49,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 514 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:39:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-06 22:39:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 173. [2023-11-06 22:39:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 146 states have (on average 1.3835616438356164) internal successors, (202), 146 states have internal predecessors, (202), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:39:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2023-11-06 22:39:49,589 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 117 [2023-11-06 22:39:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:49,591 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2023-11-06 22:39:49,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:49,591 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2023-11-06 22:39:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 22:39:49,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:49,593 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:49,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:39:49,594 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:49,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1812575135, now seen corresponding path program 1 times [2023-11-06 22:39:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:49,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000206577] [2023-11-06 22:39:49,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000206577] [2023-11-06 22:39:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000206577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:50,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:39:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62459411] [2023-11-06 22:39:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:50,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:39:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:39:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:50,988 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:39:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:51,307 INFO L93 Difference]: Finished difference Result 340 states and 485 transitions. [2023-11-06 22:39:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:39:51,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-11-06 22:39:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:51,311 INFO L225 Difference]: With dead ends: 340 [2023-11-06 22:39:51,311 INFO L226 Difference]: Without dead ends: 231 [2023-11-06 22:39:51,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:39:51,313 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 128 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:51,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 416 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:39:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-06 22:39:51,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 177. [2023-11-06 22:39:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 150 states have (on average 1.3733333333333333) internal successors, (206), 150 states have internal predecessors, (206), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:39:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 254 transitions. [2023-11-06 22:39:51,329 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 254 transitions. Word has length 117 [2023-11-06 22:39:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:51,330 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 254 transitions. [2023-11-06 22:39:51,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:39:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 254 transitions. [2023-11-06 22:39:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 22:39:51,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:51,333 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:51,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:39:51,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:51,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1672026525, now seen corresponding path program 1 times [2023-11-06 22:39:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:51,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272744165] [2023-11-06 22:39:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:51,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272744165] [2023-11-06 22:39:52,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272744165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:52,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:52,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:39:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994331929] [2023-11-06 22:39:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:52,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:39:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:52,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:39:52,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:52,264 INFO L87 Difference]: Start difference. First operand 177 states and 254 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:52,627 INFO L93 Difference]: Finished difference Result 362 states and 516 transitions. [2023-11-06 22:39:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:39:52,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-11-06 22:39:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:52,630 INFO L225 Difference]: With dead ends: 362 [2023-11-06 22:39:52,630 INFO L226 Difference]: Without dead ends: 256 [2023-11-06 22:39:52,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:39:52,631 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 125 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:52,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 571 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:39:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-06 22:39:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 195. [2023-11-06 22:39:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 168 states have (on average 1.3630952380952381) internal successors, (229), 168 states have internal predecessors, (229), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:39:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2023-11-06 22:39:52,648 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 117 [2023-11-06 22:39:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:52,648 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2023-11-06 22:39:52,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2023-11-06 22:39:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:39:52,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:52,651 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:52,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:39:52,651 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:52,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash 995746142, now seen corresponding path program 1 times [2023-11-06 22:39:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:52,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115030667] [2023-11-06 22:39:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:54,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:54,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115030667] [2023-11-06 22:39:54,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115030667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:54,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:54,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:39:54,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216118344] [2023-11-06 22:39:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:54,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:39:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:54,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:39:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:54,049 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:39:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:54,379 INFO L93 Difference]: Finished difference Result 397 states and 563 transitions. [2023-11-06 22:39:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:39:54,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-11-06 22:39:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:54,383 INFO L225 Difference]: With dead ends: 397 [2023-11-06 22:39:54,383 INFO L226 Difference]: Without dead ends: 278 [2023-11-06 22:39:54,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:39:54,387 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 213 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:54,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 464 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:39:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-11-06 22:39:54,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 203. [2023-11-06 22:39:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 176 states have (on average 1.3693181818181819) internal successors, (241), 176 states have internal predecessors, (241), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:39:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 289 transitions. [2023-11-06 22:39:54,408 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 289 transitions. Word has length 119 [2023-11-06 22:39:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:54,409 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 289 transitions. [2023-11-06 22:39:54,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:39:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 289 transitions. [2023-11-06 22:39:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:39:54,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:54,411 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:54,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:39:54,412 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:54,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -15371108, now seen corresponding path program 1 times [2023-11-06 22:39:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916546545] [2023-11-06 22:39:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916546545] [2023-11-06 22:39:54,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916546545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:54,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:54,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:39:54,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362996467] [2023-11-06 22:39:54,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:54,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:39:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:54,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:39:54,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:39:54,643 INFO L87 Difference]: Start difference. First operand 203 states and 289 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:54,694 INFO L93 Difference]: Finished difference Result 351 states and 502 transitions. [2023-11-06 22:39:54,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:39:54,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-06 22:39:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:54,697 INFO L225 Difference]: With dead ends: 351 [2023-11-06 22:39:54,697 INFO L226 Difference]: Without dead ends: 224 [2023-11-06 22:39:54,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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:39:54,699 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 80 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:54,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 573 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-06 22:39:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2023-11-06 22:39:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 179 states have (on average 1.3631284916201116) internal successors, (244), 179 states have internal predecessors, (244), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:39:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 292 transitions. [2023-11-06 22:39:54,713 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 292 transitions. Word has length 119 [2023-11-06 22:39:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:54,714 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 292 transitions. [2023-11-06 22:39:54,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 292 transitions. [2023-11-06 22:39:54,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:39:54,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:54,716 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:54,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:39:54,717 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:54,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1447594377, now seen corresponding path program 1 times [2023-11-06 22:39:54,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:54,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675608027] [2023-11-06 22:39:54,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:54,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:55,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:55,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675608027] [2023-11-06 22:39:55,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675608027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:55,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:55,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:39:55,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183264400] [2023-11-06 22:39:55,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:55,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:39:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:55,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:39:55,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:55,699 INFO L87 Difference]: Start difference. First operand 206 states and 292 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:55,931 INFO L93 Difference]: Finished difference Result 453 states and 644 transitions. [2023-11-06 22:39:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:39:55,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-06 22:39:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:55,935 INFO L225 Difference]: With dead ends: 453 [2023-11-06 22:39:55,935 INFO L226 Difference]: Without dead ends: 320 [2023-11-06 22:39:55,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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:39:55,936 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 102 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:55,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 363 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:39:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-11-06 22:39:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2023-11-06 22:39:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 277 states have (on average 1.364620938628159) internal successors, (378), 277 states have internal predecessors, (378), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:39:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 450 transitions. [2023-11-06 22:39:55,958 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 450 transitions. Word has length 119 [2023-11-06 22:39:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:55,959 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 450 transitions. [2023-11-06 22:39:55,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 450 transitions. [2023-11-06 22:39:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:39:55,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:55,961 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:55,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:39:55,961 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:55,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:55,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1041934585, now seen corresponding path program 1 times [2023-11-06 22:39:55,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:55,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468594848] [2023-11-06 22:39:55,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:57,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:57,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468594848] [2023-11-06 22:39:57,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468594848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:57,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:39:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14823123] [2023-11-06 22:39:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:57,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:39:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:57,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:39:57,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:57,116 INFO L87 Difference]: Start difference. First operand 317 states and 450 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:39:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:57,559 INFO L93 Difference]: Finished difference Result 605 states and 857 transitions. [2023-11-06 22:39:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:39:57,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-11-06 22:39:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:57,563 INFO L225 Difference]: With dead ends: 605 [2023-11-06 22:39:57,563 INFO L226 Difference]: Without dead ends: 371 [2023-11-06 22:39:57,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:39:57,565 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 96 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:57,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 715 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:39:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-11-06 22:39:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 317. [2023-11-06 22:39:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 277 states have (on average 1.3574007220216606) internal successors, (376), 277 states have internal predecessors, (376), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:39:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 448 transitions. [2023-11-06 22:39:57,605 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 448 transitions. Word has length 119 [2023-11-06 22:39:57,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:57,606 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 448 transitions. [2023-11-06 22:39:57,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:39:57,606 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 448 transitions. [2023-11-06 22:39:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 22:39:57,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:57,609 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:57,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:39:57,609 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:57,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash -815962526, now seen corresponding path program 1 times [2023-11-06 22:39:57,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:57,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281831357] [2023-11-06 22:39:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:57,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:57,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:57,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281831357] [2023-11-06 22:39:57,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281831357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:57,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:57,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:39:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652626151] [2023-11-06 22:39:57,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:57,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:39:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:57,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:39:57,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:39:57,845 INFO L87 Difference]: Start difference. First operand 317 states and 448 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:57,909 INFO L93 Difference]: Finished difference Result 615 states and 869 transitions. [2023-11-06 22:39:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:39:57,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2023-11-06 22:39:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:57,914 INFO L225 Difference]: With dead ends: 615 [2023-11-06 22:39:57,914 INFO L226 Difference]: Without dead ends: 381 [2023-11-06 22:39:57,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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:39:57,916 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 66 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 630 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:39:57,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 630 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-11-06 22:39:57,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 324. [2023-11-06 22:39:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 284 states have (on average 1.3485915492957747) internal successors, (383), 284 states have internal predecessors, (383), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:39:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 455 transitions. [2023-11-06 22:39:57,943 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 455 transitions. Word has length 120 [2023-11-06 22:39:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:57,943 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 455 transitions. [2023-11-06 22:39:57,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 455 transitions. [2023-11-06 22:39:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 22:39:57,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:57,946 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:57,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:39:57,947 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:57,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1754593031, now seen corresponding path program 1 times [2023-11-06 22:39:57,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:57,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575121828] [2023-11-06 22:39:57,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:57,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:58,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:58,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575121828] [2023-11-06 22:39:58,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575121828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:58,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:58,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:39:58,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197738850] [2023-11-06 22:39:58,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:58,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:39:58,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:58,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:39:58,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:58,181 INFO L87 Difference]: Start difference. First operand 324 states and 455 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:58,499 INFO L93 Difference]: Finished difference Result 907 states and 1272 transitions. [2023-11-06 22:39:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:39:58,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 22:39:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:58,504 INFO L225 Difference]: With dead ends: 907 [2023-11-06 22:39:58,505 INFO L226 Difference]: Without dead ends: 666 [2023-11-06 22:39:58,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:58,506 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 182 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:58,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 599 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:39:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-11-06 22:39:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 578. [2023-11-06 22:39:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 512 states have (on average 1.35546875) internal successors, (694), 512 states have internal predecessors, (694), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-06 22:39:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 814 transitions. [2023-11-06 22:39:58,553 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 814 transitions. Word has length 122 [2023-11-06 22:39:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:58,554 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 814 transitions. [2023-11-06 22:39:58,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 814 transitions. [2023-11-06 22:39:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 22:39:58,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:58,556 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:58,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:39:58,557 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:58,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 166245129, now seen corresponding path program 1 times [2023-11-06 22:39:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480741861] [2023-11-06 22:39:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:58,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:58,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480741861] [2023-11-06 22:39:58,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480741861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:58,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:58,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:39:58,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758500279] [2023-11-06 22:39:58,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:58,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:39:58,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:58,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:39:58,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:58,725 INFO L87 Difference]: Start difference. First operand 578 states and 814 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:58,794 INFO L93 Difference]: Finished difference Result 1264 states and 1770 transitions. [2023-11-06 22:39:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:39:58,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 22:39:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:58,800 INFO L225 Difference]: With dead ends: 1264 [2023-11-06 22:39:58,801 INFO L226 Difference]: Without dead ends: 763 [2023-11-06 22:39:58,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:58,803 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 119 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:58,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 342 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2023-11-06 22:39:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 560. [2023-11-06 22:39:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 494 states have (on average 1.3441295546558705) internal successors, (664), 494 states have internal predecessors, (664), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-06 22:39:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 784 transitions. [2023-11-06 22:39:58,854 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 784 transitions. Word has length 122 [2023-11-06 22:39:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:58,854 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 784 transitions. [2023-11-06 22:39:58,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 784 transitions. [2023-11-06 22:39:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:39:58,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:58,857 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:58,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:39:58,858 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:58,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1080541022, now seen corresponding path program 1 times [2023-11-06 22:39:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:58,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258618661] [2023-11-06 22:39:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:59,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258618661] [2023-11-06 22:39:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258618661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:59,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:59,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:39:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114225498] [2023-11-06 22:39:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:59,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:39:59,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:59,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:39:59,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:59,056 INFO L87 Difference]: Start difference. First operand 560 states and 784 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:59,096 INFO L93 Difference]: Finished difference Result 1057 states and 1478 transitions. [2023-11-06 22:39:59,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:39:59,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2023-11-06 22:39:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:59,101 INFO L225 Difference]: With dead ends: 1057 [2023-11-06 22:39:59,102 INFO L226 Difference]: Without dead ends: 580 [2023-11-06 22:39:59,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:59,104 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 19 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:59,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 285 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:39:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2023-11-06 22:39:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 560. [2023-11-06 22:39:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 494 states have (on average 1.3360323886639676) internal successors, (660), 494 states have internal predecessors, (660), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-06 22:39:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 780 transitions. [2023-11-06 22:39:59,143 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 780 transitions. Word has length 124 [2023-11-06 22:39:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:59,144 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 780 transitions. [2023-11-06 22:39:59,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 780 transitions. [2023-11-06 22:39:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:39:59,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:59,147 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:59,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:39:59,147 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:59,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash -755185465, now seen corresponding path program 1 times [2023-11-06 22:39:59,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:59,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535658328] [2023-11-06 22:39:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:59,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:39:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:39:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:39:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:39:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:39:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:39:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:39:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:39:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:39:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:39:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:39:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:39:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:39:59,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:59,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535658328] [2023-11-06 22:39:59,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535658328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:59,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:59,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:39:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098772604] [2023-11-06 22:39:59,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:59,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:39:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:59,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:39:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:39:59,425 INFO L87 Difference]: Start difference. First operand 560 states and 780 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:59,830 INFO L93 Difference]: Finished difference Result 1221 states and 1683 transitions. [2023-11-06 22:39:59,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:39:59,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2023-11-06 22:39:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:59,836 INFO L225 Difference]: With dead ends: 1221 [2023-11-06 22:39:59,836 INFO L226 Difference]: Without dead ends: 744 [2023-11-06 22:39:59,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:39:59,838 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 300 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:59,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 657 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:39:59,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2023-11-06 22:39:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 560. [2023-11-06 22:39:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 494 states have (on average 1.3238866396761133) internal successors, (654), 494 states have internal predecessors, (654), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-06 22:39:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 774 transitions. [2023-11-06 22:39:59,883 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 774 transitions. Word has length 124 [2023-11-06 22:39:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:59,883 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 774 transitions. [2023-11-06 22:39:59,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:39:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 774 transitions. [2023-11-06 22:39:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:39:59,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:59,886 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:59,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:39:59,886 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:39:59,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1850838089, now seen corresponding path program 1 times [2023-11-06 22:39:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:59,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825085757] [2023-11-06 22:39:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:39:59,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:40:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:40:00,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:40:00,113 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:40:00,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:40:00,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:40:00,121 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:00,125 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:40:00,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:40:00 BoogieIcfgContainer [2023-11-06 22:40:00,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:40:00,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:40:00,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:40:00,248 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:40:00,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:44" (3/4) ... [2023-11-06 22:40:00,251 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:40:00,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:40:00,253 INFO L158 Benchmark]: Toolchain (without parser) took 17501.69ms. Allocated memory was 142.6MB in the beginning and 406.8MB in the end (delta: 264.2MB). Free memory was 97.6MB in the beginning and 185.0MB in the end (delta: -87.4MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. [2023-11-06 22:40:00,254 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:40:00,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.60ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 81.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:40:00,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.38ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 78.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:40:00,255 INFO L158 Benchmark]: Boogie Preprocessor took 60.36ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 75.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:40:00,256 INFO L158 Benchmark]: RCFGBuilder took 873.52ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 75.1MB in the beginning and 145.1MB in the end (delta: -70.0MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2023-11-06 22:40:00,256 INFO L158 Benchmark]: TraceAbstraction took 15971.03ms. Allocated memory was 192.9MB in the beginning and 406.8MB in the end (delta: 213.9MB). Free memory was 145.1MB in the beginning and 185.0MB in the end (delta: -39.9MB). Peak memory consumption was 173.0MB. Max. memory is 16.1GB. [2023-11-06 22:40:00,256 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 406.8MB. Free memory is still 185.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:40:00,265 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.31ms. Allocated memory is still 142.6MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.60ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 81.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.38ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 78.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.36ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 75.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 873.52ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 75.1MB in the beginning and 145.1MB in the end (delta: -70.0MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15971.03ms. Allocated memory was 192.9MB in the beginning and 406.8MB in the end (delta: 213.9MB). Free memory was 145.1MB in the beginning and 185.0MB in the end (delta: -39.9MB). Peak memory consumption was 173.0MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 406.8MB. Free memory is still 185.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 someBinaryDOUBLEComparisonOperation at line 116, overapproximation of shiftRight at line 79, overapproximation of someBinaryArithmeticDOUBLEoperation at line 74. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L55] signed long int last_1_WrapperStruct00_var_1_12 = -5; [L56] unsigned char last_1_WrapperStruct00_var_1_17 = 2; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L112] EXPR WrapperStruct00.var_1_12 [L112] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L113] EXPR WrapperStruct00.var_1_17 [L113] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L123] RET updateLastVariables() [L124] CALL updateVariables() [L90] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00.var_1_5=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00.var_1_5=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L96] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_8 [L97] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_8 [L97] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00.var_1_8=516, WrapperStruct00.var_1_8=516, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L97] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )=1, WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F=1, WrapperStruct00.var_1_8=516, WrapperStruct00.var_1_8=516, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )=1, WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F=1, WrapperStruct00.var_1_8=516, WrapperStruct00.var_1_8=516, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L98] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_9 [L99] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_9 [L99] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00.var_1_9=514, WrapperStruct00.var_1_9=514, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L99] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )=1, WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F=1, WrapperStruct00.var_1_9=514, WrapperStruct00.var_1_9=514, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )=1, WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F=1, WrapperStruct00.var_1_9=514, WrapperStruct00.var_1_9=514, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L100] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_10 [L101] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_10 [L101] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00.var_1_10=518, WrapperStruct00.var_1_10=518, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L101] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )=1, WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F=1, WrapperStruct00.var_1_10=518, WrapperStruct00.var_1_10=518, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )=1, WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F=1, WrapperStruct00.var_1_10=518, WrapperStruct00.var_1_10=518, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_11 [L103] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_11 [L103] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00.var_1_11=511, WrapperStruct00.var_1_11=511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L103] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )=1, WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F=1, WrapperStruct00.var_1_11=511, WrapperStruct00.var_1_11=511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )=1, WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F=1, WrapperStruct00.var_1_11=511, WrapperStruct00.var_1_11=511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L104] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=-513, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 127) VAL [WrapperStruct00.var_1_14=-513, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=-513, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 255) VAL [WrapperStruct00.var_1_14=-513, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L107] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00.var_1_18=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00.var_1_18=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00.var_1_18=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00.var_1_18=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L124] RET updateVariables() [L125] CALL step() [L60] unsigned char stepLocal_1 = last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17; [L61] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17; [L62] WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0] [L62] COND TRUE WrapperStruct00.var_1_2 [L63] stepLocal_1 && WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1 && WrapperStruct00.var_1_5=0, stepLocal_1=0] [L63] COND FALSE !(stepLocal_1 && WrapperStruct00.var_1_5) [L73] WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0] [L73] COND TRUE WrapperStruct00.var_1_2 [L74] EXPR WrapperStruct00.var_1_8 [L74] EXPR WrapperStruct00.var_1_9 [L74] EXPR WrapperStruct00.var_1_10 [L74] EXPR WrapperStruct00.var_1_11 [L74] WrapperStruct00.var_1_7 = (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11) [L76] EXPR WrapperStruct00.var_1_8 [L76] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_8 [L77] EXPR WrapperStruct00.var_1_14 [L77] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_14 [L78] EXPR WrapperStruct00.var_1_18 [L78] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L79] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00.var_1_1=10, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0] [L79] EXPR -4 >> WrapperStruct00.var_1_1 VAL [-4 >> WrapperStruct00.var_1_1=-5, WrapperStruct00.var_1_1=10, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0] [L79] EXPR WrapperStruct00.var_1_1 VAL [-4 >> WrapperStruct00.var_1_1=-5, WrapperStruct00.var_1_1=10, WrapperStruct00.var_1_1=10, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0] [L79] EXPR (((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1) [L79] EXPR WrapperStruct00.var_1_1 VAL [-4 >> WrapperStruct00.var_1_1=-5, WrapperStruct00.var_1_1=10, WrapperStruct00.var_1_1=10, WrapperStruct00.var_1_1=10, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0] [L79] EXPR -4 >> WrapperStruct00.var_1_1 VAL [-4 >> WrapperStruct00.var_1_1=-256, -4 >> WrapperStruct00.var_1_1=-5, WrapperStruct00.var_1_1=10, WrapperStruct00.var_1_1=10, WrapperStruct00.var_1_1=10, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0] [L79] EXPR (((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1) VAL [(((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)=-256, -4 >> WrapperStruct00.var_1_1=-256, -4 >> WrapperStruct00.var_1_1=-5, WrapperStruct00.var_1_1=10, WrapperStruct00.var_1_1=10, WrapperStruct00.var_1_1=10, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0] [L79] signed long int stepLocal_3 = ((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)); [L80] EXPR WrapperStruct00.var_1_1 [L80] signed long int stepLocal_2 = WrapperStruct00.var_1_1 / -8; [L81] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00.var_1_17=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=-1, stepLocal_3=-256] [L81] COND FALSE !((~ WrapperStruct00.var_1_17) <= stepLocal_3) [L86] EXPR WrapperStruct00.var_1_17 [L86] EXPR WrapperStruct00.var_1_14 [L86] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14) [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] EXPR WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17)) [L116] EXPR (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5 VAL [(last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5=0, WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] EXPR ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1 VAL [((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1=1, (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5=0, WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] EXPR WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17)) VAL [((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1=1, (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5=0, WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))=1, WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] EXPR (WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1) [L116] EXPR WrapperStruct00.var_1_2 VAL [((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1=1, (WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)=1, (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5=0, WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))=1, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_2=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1 [L116] EXPR WrapperStruct00.var_1_7 [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR WrapperStruct00.var_1_9 [L116] EXPR WrapperStruct00.var_1_10 [L116] EXPR WrapperStruct00.var_1_11 [L116] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1 VAL [((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1=1, (WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)=1, (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5=0, WrapperStruct00.var_1_10=518, WrapperStruct00.var_1_11=511, WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))=1, WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1=0, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_7=510, WrapperStruct00.var_1_8=516, WrapperStruct00.var_1_9=514, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] EXPR (WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1) VAL [((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1=1, (WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)=0, (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5=0, WrapperStruct00.var_1_10=518, WrapperStruct00.var_1_11=511, WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))=1, WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1=0, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_7=510, WrapperStruct00.var_1_8=516, WrapperStruct00.var_1_9=514, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] EXPR ((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14)))) VAL [((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))=0, ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1=1, (WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)=0, (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5=0, WrapperStruct00.var_1_10=518, WrapperStruct00.var_1_11=511, WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))=1, WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1=0, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_7=510, WrapperStruct00.var_1_8=516, WrapperStruct00.var_1_9=514, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] EXPR (((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_8)) VAL [(((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_8))=0, ((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))=0, ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1=1, (WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)=0, (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5=0, WrapperStruct00.var_1_10=518, WrapperStruct00.var_1_11=511, WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))=1, WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1=0, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_7=510, WrapperStruct00.var_1_8=516, WrapperStruct00.var_1_9=514, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] EXPR ((((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_16 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [((((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_16 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_8))=0, ((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))=0, ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1=1, (WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)=0, (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5=0, WrapperStruct00.var_1_10=518, WrapperStruct00.var_1_11=511, WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))=1, WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1=0, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_7=510, WrapperStruct00.var_1_8=516, WrapperStruct00.var_1_9=514, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] EXPR (((((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_16 == ((unsigned long int) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18)) VAL [(((((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_16 == ((unsigned long int) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18))=0, ((((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_16 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_8))=0, ((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))=0, ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1=1, (WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)=0, (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5=0, WrapperStruct00.var_1_10=518, WrapperStruct00.var_1_11=511, WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))=1, WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1=0, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_2=-511, WrapperStruct00.var_1_7=510, WrapperStruct00.var_1_8=516, WrapperStruct00.var_1_9=514, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116-L117] return (((((WrapperStruct00.var_1_2 ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && WrapperStruct00.var_1_5) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? (WrapperStruct00.var_1_1 == ((unsigned short int) 5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) - WrapperStruct00.var_1_11))) : 1)) && (((~ WrapperStruct00.var_1_17) <= (((((-4 >> WrapperStruct00.var_1_1)) < (WrapperStruct00.var_1_1)) ? ((-4 >> WrapperStruct00.var_1_1)) : (WrapperStruct00.var_1_1)))) ? (((WrapperStruct00.var_1_14 - 64) < (WrapperStruct00.var_1_1 / -8)) ? (WrapperStruct00.var_1_12 == ((signed long int) WrapperStruct00.var_1_1)) : 1) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_14))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_16 == ((unsigned long int) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18)) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 18, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2049 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2046 mSDsluCounter, 7903 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5441 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2311 IncrementalHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 2462 mSDtfsCounter, 2311 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=578occurred in iteration=14, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1018 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 2140 NumberOfCodeBlocks, 2140 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1999 ConstructedInterpolants, 0 QuantifiedInterpolants, 4181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 4488/4488 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:40:00,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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 a08177a217967a14ae274e8c5e7353d301abaa21d3437088fff2fbb57c26aa06 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:40:03,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:40:03,155 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:40:03,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:40:03,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:40:03,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:40:03,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:40:03,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:40:03,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:40:03,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:40:03,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:40:03,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:40:03,220 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:40:03,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:40:03,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:40:03,224 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:40:03,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:40:03,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:40:03,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:40:03,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:40:03,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:40:03,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:40:03,228 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:40:03,228 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:40:03,229 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:40:03,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:40:03,230 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:40:03,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:40:03,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:40:03,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:40:03,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:40:03,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:40:03,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:40:03,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:40:03,234 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:40:03,235 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:40:03,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:40:03,235 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:40:03,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:40:03,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:40:03,237 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:40:03,238 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:40:03,238 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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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 -> a08177a217967a14ae274e8c5e7353d301abaa21d3437088fff2fbb57c26aa06 [2023-11-06 22:40:03,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:40:03,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:40:03,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:40:03,730 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:40:03,731 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:40:03,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i [2023-11-06 22:40:06,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:40:07,192 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:40:07,193 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i [2023-11-06 22:40:07,202 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/data/83eb7f0d5/5862685b7591443badeeb3539b73dc56/FLAG27699216c [2023-11-06 22:40:07,216 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/data/83eb7f0d5/5862685b7591443badeeb3539b73dc56 [2023-11-06 22:40:07,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:40:07,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:40:07,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:40:07,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:40:07,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:40:07,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7070e829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07, skipping insertion in model container [2023-11-06 22:40:07,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,279 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:40:07,474 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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i[916,929] [2023-11-06 22:40:07,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:40:07,586 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:40:07,607 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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-55.i[916,929] [2023-11-06 22:40:07,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:40:07,717 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:40:07,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07 WrapperNode [2023-11-06 22:40:07,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:40:07,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:40:07,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:40:07,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:40:07,728 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:40:07" (1/1) ... [2023-11-06 22:40:07,775 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:40:07" (1/1) ... [2023-11-06 22:40:07,841 INFO L138 Inliner]: procedures = 39, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 373 [2023-11-06 22:40:07,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:40:07,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:40:07,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:40:07,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:40:07,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:40:07,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:40:07,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:40:07,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:40:07,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07" (1/1) ... [2023-11-06 22:40:07,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:40:07,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:07,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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:40:08,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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:40:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:40:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 22:40:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 22:40:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:40:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:40:08,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:40:08,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:40:08,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:40:08,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 22:40:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:40:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:40:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:40:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:40:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:40:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:40:08,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:40:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:40:08,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:40:08,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:40:08,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:40:08,190 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:40:08,193 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:40:13,463 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:40:13,471 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:40:13,472 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:40:13,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:13 BoogieIcfgContainer [2023-11-06 22:40:13,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:40:13,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:40:13,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:40:13,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:40:13,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:40:07" (1/3) ... [2023-11-06 22:40:13,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b38076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:40:13, skipping insertion in model container [2023-11-06 22:40:13,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:07" (2/3) ... [2023-11-06 22:40:13,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b38076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:40:13, skipping insertion in model container [2023-11-06 22:40:13,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:13" (3/3) ... [2023-11-06 22:40:13,484 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-55.i [2023-11-06 22:40:13,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:40:13,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:40:13,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:40:13,570 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;@2addfa3d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:40:13,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:40:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:40:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:40:13,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:40:13,592 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:13,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:40:13,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2007882332, now seen corresponding path program 1 times [2023-11-06 22:40:13,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:13,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509598937] [2023-11-06 22:40:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:13,613 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:40:13,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:13,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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:40:13,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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:40:13,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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 [2023-11-06 22:40:13,937 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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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:40:13,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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)] Forceful destruction successful, exit code 139 [2023-11-06 22:40:13,943 INFO L158 Benchmark]: Toolchain (without parser) took 6721.58ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 55.6MB in the beginning and 60.7MB in the end (delta: -5.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2023-11-06 22:40:13,944 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 79.7MB. Free memory was 55.2MB in the beginning and 55.2MB in the end (delta: 80.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:40:13,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.91ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 55.3MB in the beginning and 74.3MB in the end (delta: -19.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 22:40:13,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.36ms. Allocated memory is still 96.5MB. Free memory was 74.3MB in the beginning and 70.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:40:13,948 INFO L158 Benchmark]: Boogie Preprocessor took 83.02ms. Allocated memory is still 96.5MB. Free memory was 70.8MB in the beginning and 67.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:40:13,956 INFO L158 Benchmark]: RCFGBuilder took 5548.11ms. Allocated memory is still 96.5MB. Free memory was 67.4MB in the beginning and 59.0MB in the end (delta: 8.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2023-11-06 22:40:13,956 INFO L158 Benchmark]: TraceAbstraction took 463.67ms. Allocated memory is still 96.5MB. Free memory was 58.1MB in the beginning and 60.7MB in the end (delta: -2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:40:13,963 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.37ms. Allocated memory is still 79.7MB. Free memory was 55.2MB in the beginning and 55.2MB in the end (delta: 80.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.91ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 55.3MB in the beginning and 74.3MB in the end (delta: -19.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.36ms. Allocated memory is still 96.5MB. Free memory was 74.3MB in the beginning and 70.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.02ms. Allocated memory is still 96.5MB. Free memory was 70.8MB in the beginning and 67.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 5548.11ms. Allocated memory is still 96.5MB. Free memory was 67.4MB in the beginning and 59.0MB in the end (delta: 8.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 463.67ms. Allocated memory is still 96.5MB. Free memory was 58.1MB in the beginning and 60.7MB in the end (delta: -2.6MB). 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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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:40:14,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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 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_ba0b7b9d-47d2-4fb9-a214-6c5ae19b7ef0/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.