./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 214c49e8f3d3735ec742b7b163a0487f19e3afbd4fa1866f6927a51886e4b103 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:56:06,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:56:06,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:56:06,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:56:06,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:56:06,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:56:06,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:56:06,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:56:06,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:56:06,632 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:56:06,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:56:06,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:56:06,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:56:06,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:56:06,637 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:56:06,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:56:06,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:56:06,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:56:06,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:56:06,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:56:06,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:56:06,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:56:06,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:56:06,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:56:06,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:56:06,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:56:06,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:56:06,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:56:06,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:56:06,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:56:06,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:56:06,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:56:06,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:56:06,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:56:06,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:56:06,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:56:06,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:56:06,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:56:06,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:56:06,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:56:06,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:56:06,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:56:06,652 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 214c49e8f3d3735ec742b7b163a0487f19e3afbd4fa1866f6927a51886e4b103 [2024-11-19 00:56:06,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:56:06,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:56:06,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:56:06,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:56:06,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:56:06,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i [2024-11-19 00:56:08,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:56:08,687 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:56:08,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i [2024-11-19 00:56:08,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526865b4e/ecde7fa8ddde4b019eaca1cb8ab8d6fd/FLAG14bbe0032 [2024-11-19 00:56:08,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526865b4e/ecde7fa8ddde4b019eaca1cb8ab8d6fd [2024-11-19 00:56:08,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:56:08,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:56:08,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:56:08,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:56:08,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:56:08,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:56:08" (1/1) ... [2024-11-19 00:56:08,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eaaf81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:08, skipping insertion in model container [2024-11-19 00:56:08,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:56:08" (1/1) ... [2024-11-19 00:56:08,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:56:08,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i[916,929] [2024-11-19 00:56:08,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:56:09,011 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:56:09,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i[916,929] [2024-11-19 00:56:09,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:56:09,074 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:56:09,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09 WrapperNode [2024-11-19 00:56:09,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:56:09,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:56:09,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:56:09,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:56:09,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,143 INFO L138 Inliner]: procedures = 29, calls = 199, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 632 [2024-11-19 00:56:09,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:56:09,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:56:09,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:56:09,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:56:09,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,188 INFO L175 MemorySlicer]: Split 160 memory accesses to 13 slices as follows [2, 7, 30, 10, 22, 28, 9, 12, 12, 8, 7, 7, 6]. 19 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1]. [2024-11-19 00:56:09,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:56:09,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:56:09,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:56:09,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:56:09,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (1/1) ... [2024-11-19 00:56:09,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:56:09,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:56:09,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:56:09,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:56:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:56:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:56:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:56:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:56:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:56:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:56:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:56:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:56:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-19 00:56:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-19 00:56:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-19 00:56:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-19 00:56:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-19 00:56:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-19 00:56:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:56:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:56:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:56:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:56:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:56:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:56:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:56:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 00:56:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 00:56:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 00:56:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 00:56:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 00:56:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 00:56:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:56:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:56:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:56:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:56:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:56:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:56:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:56:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-19 00:56:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-19 00:56:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-19 00:56:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-19 00:56:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-19 00:56:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-19 00:56:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:56:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:56:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:56:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:56:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:56:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:56:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:56:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 00:56:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 00:56:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 00:56:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 00:56:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 00:56:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 00:56:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:56:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:56:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:56:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:56:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:56:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:56:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:56:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-19 00:56:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-19 00:56:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-19 00:56:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-19 00:56:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-19 00:56:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-19 00:56:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:56:09,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:56:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:56:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:56:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:56:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:56:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:56:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:56:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:56:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 00:56:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 00:56:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 00:56:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 00:56:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 00:56:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 00:56:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:56:09,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:56:09,574 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:56:09,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:56:10,277 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-19 00:56:10,277 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:56:10,297 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:56:10,298 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:56:10,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:56:10 BoogieIcfgContainer [2024-11-19 00:56:10,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:56:10,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:56:10,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:56:10,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:56:10,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:56:08" (1/3) ... [2024-11-19 00:56:10,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772dd43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:56:10, skipping insertion in model container [2024-11-19 00:56:10,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:09" (2/3) ... [2024-11-19 00:56:10,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772dd43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:56:10, skipping insertion in model container [2024-11-19 00:56:10,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:56:10" (3/3) ... [2024-11-19 00:56:10,308 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-39.i [2024-11-19 00:56:10,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:56:10,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:56:10,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:56:10,400 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52af860a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:56:10,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:56:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:56:10,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:10,426 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:10,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:10,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1445380245, now seen corresponding path program 1 times [2024-11-19 00:56:10,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:10,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271560273] [2024-11-19 00:56:10,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:10,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-19 00:56:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:10,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271560273] [2024-11-19 00:56:10,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271560273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092059037] [2024-11-19 00:56:10,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:10,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:56:10,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:56:10,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:56:10,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:56:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:11,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:56:11,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-19 00:56:11,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092059037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:56:11,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:56:11,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187071416] [2024-11-19 00:56:11,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:11,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:56:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:56:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:56:11,294 INFO L87 Difference]: Start difference. First operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:56:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:11,323 INFO L93 Difference]: Finished difference Result 233 states and 364 transitions. [2024-11-19 00:56:11,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:56:11,326 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-19 00:56:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:11,334 INFO L225 Difference]: With dead ends: 233 [2024-11-19 00:56:11,335 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 00:56:11,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:56:11,342 INFO L432 NwaCegarLoop]: 170 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, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:11,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 00:56:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-19 00:56:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-11-19 00:56:11,404 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 128 [2024-11-19 00:56:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:11,405 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-11-19 00:56:11,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:56:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-11-19 00:56:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:56:11,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:11,413 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:11,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:56:11,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:56:11,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:11,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:11,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1187898961, now seen corresponding path program 1 times [2024-11-19 00:56:11,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:11,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992902385] [2024-11-19 00:56:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:11,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992902385] [2024-11-19 00:56:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992902385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:14,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:14,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 00:56:14,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331894814] [2024-11-19 00:56:14,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:14,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:56:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:14,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:56:14,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:56:14,802 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:16,013 INFO L93 Difference]: Finished difference Result 328 states and 481 transitions. [2024-11-19 00:56:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:56:16,014 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-19 00:56:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:16,016 INFO L225 Difference]: With dead ends: 328 [2024-11-19 00:56:16,016 INFO L226 Difference]: Without dead ends: 215 [2024-11-19 00:56:16,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:56:16,019 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 139 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:16,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1448 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:56:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-19 00:56:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 126. [2024-11-19 00:56:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2024-11-19 00:56:16,033 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 128 [2024-11-19 00:56:16,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:16,035 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2024-11-19 00:56:16,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2024-11-19 00:56:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:56:16,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:16,038 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:16,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:56:16,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:16,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash -507840591, now seen corresponding path program 1 times [2024-11-19 00:56:16,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:16,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143203473] [2024-11-19 00:56:16,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:16,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:16,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:16,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143203473] [2024-11-19 00:56:16,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143203473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:16,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:16,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:16,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176622455] [2024-11-19 00:56:16,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:16,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:16,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:16,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:16,315 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:16,526 INFO L93 Difference]: Finished difference Result 319 states and 466 transitions. [2024-11-19 00:56:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:16,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-19 00:56:16,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:16,531 INFO L225 Difference]: With dead ends: 319 [2024-11-19 00:56:16,531 INFO L226 Difference]: Without dead ends: 196 [2024-11-19 00:56:16,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:16,535 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 98 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:16,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 594 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-19 00:56:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-11-19 00:56:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 170 states have (on average 1.4176470588235295) internal successors, (241), 171 states have internal predecessors, (241), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:56:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 281 transitions. [2024-11-19 00:56:16,552 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 281 transitions. Word has length 128 [2024-11-19 00:56:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:16,554 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 281 transitions. [2024-11-19 00:56:16,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 281 transitions. [2024-11-19 00:56:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:56:16,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:16,558 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:16,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:56:16,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:16,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1518720433, now seen corresponding path program 1 times [2024-11-19 00:56:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480876840] [2024-11-19 00:56:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:16,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:16,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480876840] [2024-11-19 00:56:16,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480876840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:16,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:16,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:16,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238207347] [2024-11-19 00:56:16,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:16,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:16,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:16,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:16,795 INFO L87 Difference]: Start difference. First operand 193 states and 281 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:16,995 INFO L93 Difference]: Finished difference Result 390 states and 564 transitions. [2024-11-19 00:56:16,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:16,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-19 00:56:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:17,000 INFO L225 Difference]: With dead ends: 390 [2024-11-19 00:56:17,000 INFO L226 Difference]: Without dead ends: 200 [2024-11-19 00:56:17,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:17,002 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 96 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:17,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 693 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-19 00:56:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2024-11-19 00:56:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.406015037593985) internal successors, (187), 133 states have internal predecessors, (187), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2024-11-19 00:56:17,025 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 128 [2024-11-19 00:56:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:17,026 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 219 transitions. [2024-11-19 00:56:17,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:17,026 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 219 transitions. [2024-11-19 00:56:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:56:17,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:17,028 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:17,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:56:17,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:17,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2096188493, now seen corresponding path program 1 times [2024-11-19 00:56:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280695942] [2024-11-19 00:56:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280695942] [2024-11-19 00:56:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280695942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:18,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:18,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:56:18,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950615075] [2024-11-19 00:56:18,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:18,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:56:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:18,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:56:18,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:56:18,105 INFO L87 Difference]: Start difference. First operand 152 states and 219 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:18,728 INFO L93 Difference]: Finished difference Result 337 states and 486 transitions. [2024-11-19 00:56:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:56:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-19 00:56:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:18,730 INFO L225 Difference]: With dead ends: 337 [2024-11-19 00:56:18,730 INFO L226 Difference]: Without dead ends: 188 [2024-11-19 00:56:18,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:56:18,732 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 82 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:18,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1269 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:56:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-19 00:56:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152. [2024-11-19 00:56:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.406015037593985) internal successors, (187), 133 states have internal predecessors, (187), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2024-11-19 00:56:18,757 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 128 [2024-11-19 00:56:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:18,758 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 219 transitions. [2024-11-19 00:56:18,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 219 transitions. [2024-11-19 00:56:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:56:18,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:18,760 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:18,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:56:18,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:18,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:18,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1138278537, now seen corresponding path program 1 times [2024-11-19 00:56:18,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:18,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324338840] [2024-11-19 00:56:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:18,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:21,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:21,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324338840] [2024-11-19 00:56:21,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324338840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:21,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:21,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 00:56:21,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355282986] [2024-11-19 00:56:21,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:21,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:56:21,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:21,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:56:21,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:56:21,623 INFO L87 Difference]: Start difference. First operand 152 states and 219 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:56:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:24,156 INFO L93 Difference]: Finished difference Result 406 states and 587 transitions. [2024-11-19 00:56:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:56:24,157 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2024-11-19 00:56:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:24,160 INFO L225 Difference]: With dead ends: 406 [2024-11-19 00:56:24,161 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 00:56:24,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:56:24,163 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 649 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:24,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1321 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 00:56:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 00:56:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 164. [2024-11-19 00:56:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 145 states have (on average 1.4275862068965517) internal successors, (207), 145 states have internal predecessors, (207), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 239 transitions. [2024-11-19 00:56:24,183 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 239 transitions. Word has length 129 [2024-11-19 00:56:24,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:24,183 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 239 transitions. [2024-11-19 00:56:24,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:56:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 239 transitions. [2024-11-19 00:56:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:56:24,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:24,186 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:24,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:56:24,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:24,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash -769167637, now seen corresponding path program 1 times [2024-11-19 00:56:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468194755] [2024-11-19 00:56:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:25,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:25,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468194755] [2024-11-19 00:56:25,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468194755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:25,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:25,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:56:25,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643880415] [2024-11-19 00:56:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:25,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:56:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:25,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:56:25,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:56:25,052 INFO L87 Difference]: Start difference. First operand 164 states and 239 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:25,486 INFO L93 Difference]: Finished difference Result 361 states and 525 transitions. [2024-11-19 00:56:25,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:56:25,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2024-11-19 00:56:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:25,488 INFO L225 Difference]: With dead ends: 361 [2024-11-19 00:56:25,488 INFO L226 Difference]: Without dead ends: 200 [2024-11-19 00:56:25,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:56:25,490 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 80 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:25,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 859 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:56:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-19 00:56:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 144. [2024-11-19 00:56:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.408) internal successors, (176), 125 states have internal predecessors, (176), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2024-11-19 00:56:25,500 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 129 [2024-11-19 00:56:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:25,500 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2024-11-19 00:56:25,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2024-11-19 00:56:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 00:56:25,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:25,502 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:25,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:56:25,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:25,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash 170888346, now seen corresponding path program 1 times [2024-11-19 00:56:25,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:25,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523368417] [2024-11-19 00:56:25,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:25,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:25,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523368417] [2024-11-19 00:56:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523368417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:25,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:25,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:56:25,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125556191] [2024-11-19 00:56:25,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:25,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:56:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:25,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:56:25,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:25,767 INFO L87 Difference]: Start difference. First operand 144 states and 208 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:25,908 INFO L93 Difference]: Finished difference Result 374 states and 540 transitions. [2024-11-19 00:56:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:56:25,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-11-19 00:56:25,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:25,911 INFO L225 Difference]: With dead ends: 374 [2024-11-19 00:56:25,911 INFO L226 Difference]: Without dead ends: 233 [2024-11-19 00:56:25,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:56:25,913 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 89 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:25,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 818 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-19 00:56:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 188. [2024-11-19 00:56:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.4260355029585798) internal successors, (241), 169 states have internal predecessors, (241), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 273 transitions. [2024-11-19 00:56:25,930 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 273 transitions. Word has length 130 [2024-11-19 00:56:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:25,930 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 273 transitions. [2024-11-19 00:56:25,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 273 transitions. [2024-11-19 00:56:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:56:25,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:25,933 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:25,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:56:25,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:25,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1173377948, now seen corresponding path program 1 times [2024-11-19 00:56:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521285708] [2024-11-19 00:56:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521285708] [2024-11-19 00:56:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521285708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:26,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472348666] [2024-11-19 00:56:26,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:26,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:26,152 INFO L87 Difference]: Start difference. First operand 188 states and 273 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:26,311 INFO L93 Difference]: Finished difference Result 406 states and 589 transitions. [2024-11-19 00:56:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:26,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-19 00:56:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:26,313 INFO L225 Difference]: With dead ends: 406 [2024-11-19 00:56:26,313 INFO L226 Difference]: Without dead ends: 221 [2024-11-19 00:56:26,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:26,314 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 75 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:26,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 741 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-19 00:56:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 188. [2024-11-19 00:56:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.4201183431952662) internal successors, (240), 169 states have internal predecessors, (240), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 272 transitions. [2024-11-19 00:56:26,331 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 272 transitions. Word has length 133 [2024-11-19 00:56:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:26,331 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 272 transitions. [2024-11-19 00:56:26,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 272 transitions. [2024-11-19 00:56:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:26,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:26,333 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:26,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:56:26,334 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:26,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:26,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1698063234, now seen corresponding path program 1 times [2024-11-19 00:56:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:26,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051740856] [2024-11-19 00:56:26,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:26,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:26,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:26,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051740856] [2024-11-19 00:56:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051740856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:26,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:26,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:26,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530283762] [2024-11-19 00:56:26,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:26,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:26,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:26,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:26,506 INFO L87 Difference]: Start difference. First operand 188 states and 272 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:26,643 INFO L93 Difference]: Finished difference Result 399 states and 577 transitions. [2024-11-19 00:56:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:26,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-19 00:56:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:26,648 INFO L225 Difference]: With dead ends: 399 [2024-11-19 00:56:26,648 INFO L226 Difference]: Without dead ends: 214 [2024-11-19 00:56:26,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:26,653 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 64 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:26,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 554 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-19 00:56:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 188. [2024-11-19 00:56:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.4142011834319526) internal successors, (239), 169 states have internal predecessors, (239), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 271 transitions. [2024-11-19 00:56:26,669 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 271 transitions. Word has length 134 [2024-11-19 00:56:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:26,670 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 271 transitions. [2024-11-19 00:56:26,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 271 transitions. [2024-11-19 00:56:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:26,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:26,672 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:26,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:56:26,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:26,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash -680036997, now seen corresponding path program 1 times [2024-11-19 00:56:26,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:26,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51567896] [2024-11-19 00:56:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:26,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51567896] [2024-11-19 00:56:26,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51567896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:26,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:26,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:56:26,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312639547] [2024-11-19 00:56:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:27,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:56:27,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:27,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:56:27,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:56:27,001 INFO L87 Difference]: Start difference. First operand 188 states and 271 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:27,146 INFO L93 Difference]: Finished difference Result 244 states and 340 transitions. [2024-11-19 00:56:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:56:27,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-19 00:56:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:27,149 INFO L225 Difference]: With dead ends: 244 [2024-11-19 00:56:27,149 INFO L226 Difference]: Without dead ends: 242 [2024-11-19 00:56:27,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:56:27,149 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 46 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:27,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 901 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-19 00:56:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 220. [2024-11-19 00:56:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 201 states have (on average 1.373134328358209) internal successors, (276), 201 states have internal predecessors, (276), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 308 transitions. [2024-11-19 00:56:27,160 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 308 transitions. Word has length 134 [2024-11-19 00:56:27,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:27,161 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 308 transitions. [2024-11-19 00:56:27,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 308 transitions. [2024-11-19 00:56:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:56:27,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:27,162 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:27,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:56:27,163 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:27,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:27,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1541926699, now seen corresponding path program 1 times [2024-11-19 00:56:27,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:27,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010640540] [2024-11-19 00:56:27,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:27,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:27,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:27,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010640540] [2024-11-19 00:56:27,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010640540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:27,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:27,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:56:27,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370718910] [2024-11-19 00:56:27,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:27,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:56:27,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:27,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:56:27,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:56:27,840 INFO L87 Difference]: Start difference. First operand 220 states and 308 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:56:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:28,606 INFO L93 Difference]: Finished difference Result 557 states and 786 transitions. [2024-11-19 00:56:28,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:56:28,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 135 [2024-11-19 00:56:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:28,609 INFO L225 Difference]: With dead ends: 557 [2024-11-19 00:56:28,609 INFO L226 Difference]: Without dead ends: 340 [2024-11-19 00:56:28,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:56:28,611 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 256 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:28,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1273 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:56:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-19 00:56:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 303. [2024-11-19 00:56:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 284 states have (on average 1.4049295774647887) internal successors, (399), 284 states have internal predecessors, (399), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 431 transitions. [2024-11-19 00:56:28,625 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 431 transitions. Word has length 135 [2024-11-19 00:56:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:28,625 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 431 transitions. [2024-11-19 00:56:28,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:56:28,625 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 431 transitions. [2024-11-19 00:56:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:56:28,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:28,628 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:28,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:56:28,628 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:28,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash 984381808, now seen corresponding path program 1 times [2024-11-19 00:56:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:28,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369684815] [2024-11-19 00:56:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:28,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:29,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:29,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369684815] [2024-11-19 00:56:29,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369684815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:29,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:29,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:56:29,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244993905] [2024-11-19 00:56:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:29,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:56:29,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:29,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:56:29,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:56:29,268 INFO L87 Difference]: Start difference. First operand 303 states and 431 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:56:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:29,993 INFO L93 Difference]: Finished difference Result 671 states and 944 transitions. [2024-11-19 00:56:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:56:29,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 136 [2024-11-19 00:56:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:29,996 INFO L225 Difference]: With dead ends: 671 [2024-11-19 00:56:29,997 INFO L226 Difference]: Without dead ends: 371 [2024-11-19 00:56:29,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:56:29,999 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 263 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:29,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1146 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:56:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-19 00:56:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 330. [2024-11-19 00:56:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 311 states have (on average 1.382636655948553) internal successors, (430), 311 states have internal predecessors, (430), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 462 transitions. [2024-11-19 00:56:30,017 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 462 transitions. Word has length 136 [2024-11-19 00:56:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:30,017 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 462 transitions. [2024-11-19 00:56:30,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:56:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 462 transitions. [2024-11-19 00:56:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:56:30,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:30,020 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:30,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:56:30,020 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:30,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:30,021 INFO L85 PathProgramCache]: Analyzing trace with hash 937697052, now seen corresponding path program 1 times [2024-11-19 00:56:30,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:30,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200020176] [2024-11-19 00:56:30,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:30,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:30,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:30,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200020176] [2024-11-19 00:56:30,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200020176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:30,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:30,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:30,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909152656] [2024-11-19 00:56:30,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:30,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:30,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:30,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:30,187 INFO L87 Difference]: Start difference. First operand 330 states and 462 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:30,372 INFO L93 Difference]: Finished difference Result 683 states and 955 transitions. [2024-11-19 00:56:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:30,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-19 00:56:30,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:30,376 INFO L225 Difference]: With dead ends: 683 [2024-11-19 00:56:30,376 INFO L226 Difference]: Without dead ends: 356 [2024-11-19 00:56:30,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:30,378 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 65 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:30,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 518 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-19 00:56:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 330. [2024-11-19 00:56:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 311 states have (on average 1.3762057877813505) internal successors, (428), 311 states have internal predecessors, (428), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 460 transitions. [2024-11-19 00:56:30,396 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 460 transitions. Word has length 136 [2024-11-19 00:56:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:30,397 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 460 transitions. [2024-11-19 00:56:30,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 460 transitions. [2024-11-19 00:56:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:56:30,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:30,399 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:30,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:56:30,400 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:30,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1708154855, now seen corresponding path program 1 times [2024-11-19 00:56:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630600152] [2024-11-19 00:56:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630600152] [2024-11-19 00:56:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630600152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:30,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:30,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396703469] [2024-11-19 00:56:30,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:30,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:30,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:30,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:30,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:30,608 INFO L87 Difference]: Start difference. First operand 330 states and 460 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:30,793 INFO L93 Difference]: Finished difference Result 683 states and 951 transitions. [2024-11-19 00:56:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:30,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-19 00:56:30,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:30,796 INFO L225 Difference]: With dead ends: 683 [2024-11-19 00:56:30,797 INFO L226 Difference]: Without dead ends: 356 [2024-11-19 00:56:30,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:30,800 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 64 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:30,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 694 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-19 00:56:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 330. [2024-11-19 00:56:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 311 states have (on average 1.369774919614148) internal successors, (426), 311 states have internal predecessors, (426), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 458 transitions. [2024-11-19 00:56:30,816 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 458 transitions. Word has length 136 [2024-11-19 00:56:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:30,818 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 458 transitions. [2024-11-19 00:56:30,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 458 transitions. [2024-11-19 00:56:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:30,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:30,820 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:30,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:56:30,821 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:30,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1637066314, now seen corresponding path program 1 times [2024-11-19 00:56:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915485490] [2024-11-19 00:56:30,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:31,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915485490] [2024-11-19 00:56:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915485490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:31,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:56:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749968354] [2024-11-19 00:56:31,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:31,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:56:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:31,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:56:31,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:56:31,179 INFO L87 Difference]: Start difference. First operand 330 states and 458 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:31,344 INFO L93 Difference]: Finished difference Result 426 states and 572 transitions. [2024-11-19 00:56:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:56:31,345 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-19 00:56:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:31,347 INFO L225 Difference]: With dead ends: 426 [2024-11-19 00:56:31,347 INFO L226 Difference]: Without dead ends: 424 [2024-11-19 00:56:31,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:56:31,348 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 61 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:31,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1301 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-19 00:56:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 387. [2024-11-19 00:56:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 368 states have (on average 1.3342391304347827) internal successors, (491), 368 states have internal predecessors, (491), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 523 transitions. [2024-11-19 00:56:31,364 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 523 transitions. Word has length 137 [2024-11-19 00:56:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:31,365 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 523 transitions. [2024-11-19 00:56:31,365 INFO L472 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 523 transitions. [2024-11-19 00:56:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:31,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:31,367 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:31,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:56:31,368 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:31,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:31,368 INFO L85 PathProgramCache]: Analyzing trace with hash 79591512, now seen corresponding path program 1 times [2024-11-19 00:56:31,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:31,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454766874] [2024-11-19 00:56:31,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:56:31,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [686218232] [2024-11-19 00:56:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:31,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:56:31,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:56:31,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:56:31,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:56:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:56:32,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:56:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:56:32,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:56:32,367 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:56:32,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:56:32,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:32,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 00:56:32,575 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:32,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:56:32,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:56:32 BoogieIcfgContainer [2024-11-19 00:56:32,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:56:32,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:56:32,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:56:32,786 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:56:32,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:56:10" (3/4) ... [2024-11-19 00:56:32,790 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:56:32,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:56:32,792 INFO L158 Benchmark]: Toolchain (without parser) took 24080.89ms. Allocated memory was 161.5MB in the beginning and 616.6MB in the end (delta: 455.1MB). Free memory was 102.3MB in the beginning and 485.8MB in the end (delta: -383.5MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-11-19 00:56:32,793 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:56:32,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.56ms. Allocated memory is still 161.5MB. Free memory was 101.7MB in the beginning and 85.5MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:56:32,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.84ms. Allocated memory is still 161.5MB. Free memory was 85.0MB in the beginning and 81.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:56:32,794 INFO L158 Benchmark]: Boogie Preprocessor took 103.86ms. Allocated memory is still 161.5MB. Free memory was 81.3MB in the beginning and 76.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:56:32,794 INFO L158 Benchmark]: RCFGBuilder took 1049.14ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 76.0MB in the beginning and 202.2MB in the end (delta: -126.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-11-19 00:56:32,794 INFO L158 Benchmark]: TraceAbstraction took 22482.98ms. Allocated memory was 245.4MB in the beginning and 616.6MB in the end (delta: 371.2MB). Free memory was 201.1MB in the beginning and 486.9MB in the end (delta: -285.7MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2024-11-19 00:56:32,795 INFO L158 Benchmark]: Witness Printer took 5.61ms. Allocated memory is still 616.6MB. Free memory was 486.9MB in the beginning and 485.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:56:32,796 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.21ms. Allocated memory is still 161.5MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.56ms. Allocated memory is still 161.5MB. Free memory was 101.7MB in the beginning and 85.5MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.84ms. Allocated memory is still 161.5MB. Free memory was 85.0MB in the beginning and 81.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.86ms. Allocated memory is still 161.5MB. Free memory was 81.3MB in the beginning and 76.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1049.14ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 76.0MB in the beginning and 202.2MB in the end (delta: -126.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22482.98ms. Allocated memory was 245.4MB in the beginning and 616.6MB in the end (delta: 371.2MB). Free memory was 201.1MB in the beginning and 486.9MB in the end (delta: -285.7MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. * Witness Printer took 5.61ms. Allocated memory is still 616.6MB. Free memory was 486.9MB in the beginning and 485.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of shiftLeft at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L22] signed short int var_1_1 = -5; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_2 = 0; [L24] signed short int var_1_2 = 0; [L25] signed short int* var_1_2_Pointer = &(var_1_2); [L26] signed short int var_1_3 = 1000; [L26] signed short int var_1_3 = 1000; [L27] signed short int* var_1_3_Pointer = &(var_1_3); [L28] signed short int var_1_4 = 10; [L28] signed short int var_1_4 = 10; [L29] signed short int* var_1_4_Pointer = &(var_1_4); [L30] signed short int var_1_5 = 32; [L30] signed short int var_1_5 = 32; [L31] signed short int* var_1_5_Pointer = &(var_1_5); [L32] signed long int var_1_6 = 5; [L32] signed long int var_1_6 = 5; [L33] signed long int* var_1_6_Pointer = &(var_1_6); [L34] float var_1_7 = 1.1; [L34] float var_1_7 = 1.1; [L35] float* var_1_7_Pointer = &(var_1_7); [L36] float var_1_8 = 7.8; [L36] float var_1_8 = 7.8; [L37] float* var_1_8_Pointer = &(var_1_8); [L38] float var_1_9 = 1.75; [L38] float var_1_9 = 1.75; [L39] float* var_1_9_Pointer = &(var_1_9); [L40] signed long int var_1_10 = 32; [L40] signed long int var_1_10 = 32; [L41] signed long int* var_1_10_Pointer = &(var_1_10); [L42] unsigned char var_1_11 = 64; [L42] unsigned char var_1_11 = 64; [L43] unsigned char* var_1_11_Pointer = &(var_1_11); [L44] signed long int var_1_12 = 1230482582; [L44] signed long int var_1_12 = 1230482582; [L45] signed long int* var_1_12_Pointer = &(var_1_12); VAL [isInitial=0, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_short() [L73] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L74] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L74] CALL assume_abort_if_not(var_1_2 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L74] RET assume_abort_if_not(var_1_2 <= 16383) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L75] var_1_3 = __VERIFIER_nondet_short() [L76] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L77] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L77] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L77] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L78] var_1_4 = __VERIFIER_nondet_short() [L79] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L79] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L79] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L80] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L80] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L80] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L81] var_1_5 = __VERIFIER_nondet_short() [L82] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L82] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L82] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L83] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L83] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L83] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L84] var_1_7 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_7) [L85] EXPR var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] EXPR var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F [L85] EXPR \read(var_1_7) [L85] EXPR var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] EXPR (var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] EXPR (var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] var_1_8 = __VERIFIER_nondet_float() [L87] EXPR \read(var_1_8) [L87] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F [L87] EXPR \read(var_1_8) [L87] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] var_1_9 = __VERIFIER_nondet_float() [L89] EXPR \read(var_1_9) [L89] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F [L89] EXPR \read(var_1_9) [L89] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L94] var_1_12 = __VERIFIER_nondet_long() [L95] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] RET updateVariables() [L110] CALL step() [L49] EXPR \read(*var_1_2_Pointer) [L49] EXPR \read(*var_1_3_Pointer) [L49] EXPR \read(*var_1_4_Pointer) [L49] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L49] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) [L49] EXPR \read(*var_1_4_Pointer) [L49] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L49] (*(var_1_1_Pointer)) = ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))) [L50] EXPR \read(*var_1_2_Pointer) [L50] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L50] COND FALSE !((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) [L57] EXPR \read(*var_1_4_Pointer) [L57] (*(var_1_6_Pointer)) = (*(var_1_4_Pointer)) [L59] EXPR \read(*var_1_6_Pointer) [L59] EXPR \read(*var_1_4_Pointer) [L59] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L59] EXPR (*(var_1_4_Pointer)) << (*(var_1_2_Pointer)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L59] signed long int stepLocal_1 = (*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer))); [L60] EXPR \read(*var_1_2_Pointer) [L60] EXPR \read(*var_1_12_Pointer) [L60] EXPR \read(*var_1_5_Pointer) [L60] signed long int stepLocal_0 = (*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))); [L61] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L61] COND TRUE stepLocal_1 != (*(var_1_5_Pointer)) [L62] EXPR \read(*var_1_3_Pointer) [L62] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L62] COND FALSE !(((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < stepLocal_0) [L65] EXPR \read(*var_1_4_Pointer) [L65] (*(var_1_10_Pointer)) = (*(var_1_4_Pointer)) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*var_1_1_Pointer) [L101] EXPR \read(*var_1_2_Pointer) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR ((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR ((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) [L101] EXPR \read(*var_1_2_Pointer) [L101] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR ((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) [L101] EXPR \read(*var_1_6_Pointer) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR ((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR ((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))))) && ((((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))))) && ((((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer))))) [L101] EXPR \read(*var_1_6_Pointer) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (*(var_1_4_Pointer)) << (*(var_1_2_Pointer)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer)))) [L101] EXPR \read(*var_1_10_Pointer) [L101] EXPR \read(*var_1_2_Pointer) [L101] EXPR (((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))))) && ((((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101-L102] return (((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))))) && ((((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer))))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 17, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2127 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2127 mSDsluCounter, 14300 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11613 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5480 IncrementalHoareTripleChecker+Invalid, 5541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 2687 mSDtfsCounter, 5480 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=16, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 618 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 2511 NumberOfCodeBlocks, 2511 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2220 ConstructedInterpolants, 0 QuantifiedInterpolants, 8015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 560 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 8130/8160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:56:32,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 214c49e8f3d3735ec742b7b163a0487f19e3afbd4fa1866f6927a51886e4b103 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:56:35,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:56:35,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:56:35,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:56:35,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:56:35,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:56:35,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:56:35,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:56:35,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:56:35,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:56:35,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:56:35,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:56:35,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:56:35,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:56:35,447 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:56:35,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:56:35,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:56:35,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:56:35,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:56:35,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:56:35,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:56:35,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:56:35,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:56:35,453 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:56:35,453 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:56:35,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:56:35,454 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:56:35,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:56:35,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:56:35,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:56:35,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:56:35,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:56:35,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:56:35,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:56:35,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:56:35,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:56:35,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:56:35,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:56:35,463 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:56:35,464 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:35,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:56:35,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:56:35,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:56:35,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:56:35,470 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 214c49e8f3d3735ec742b7b163a0487f19e3afbd4fa1866f6927a51886e4b103 [2024-11-19 00:56:35,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:56:35,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:56:35,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:56:35,869 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:56:35,870 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:56:35,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i [2024-11-19 00:56:37,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:56:37,902 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:56:37,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i [2024-11-19 00:56:37,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707aeb69f/22667571521c4845b86f35aa396b2b45/FLAG4751b4a7d [2024-11-19 00:56:37,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707aeb69f/22667571521c4845b86f35aa396b2b45 [2024-11-19 00:56:37,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:56:37,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:56:37,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:56:37,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:56:37,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:56:37,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:56:37" (1/1) ... [2024-11-19 00:56:37,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5bd1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:37, skipping insertion in model container [2024-11-19 00:56:37,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:56:37" (1/1) ... [2024-11-19 00:56:37,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:56:38,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i[916,929] [2024-11-19 00:56:38,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:56:38,320 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:56:38,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i[916,929] [2024-11-19 00:56:38,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:56:38,401 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:56:38,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38 WrapperNode [2024-11-19 00:56:38,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:56:38,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:56:38,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:56:38,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:56:38,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,476 INFO L138 Inliner]: procedures = 36, calls = 199, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 614 [2024-11-19 00:56:38,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:56:38,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:56:38,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:56:38,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:56:38,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,544 INFO L175 MemorySlicer]: Split 160 memory accesses to 13 slices as follows [2, 7, 30, 10, 22, 28, 9, 12, 12, 8, 7, 7, 6]. 19 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1]. [2024-11-19 00:56:38,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:56:38,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:56:38,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:56:38,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:56:38,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (1/1) ... [2024-11-19 00:56:38,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:56:38,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:56:38,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:56:38,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:56:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:56:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:56:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:56:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:56:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:56:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:56:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:56:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 00:56:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 00:56:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 00:56:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 00:56:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-19 00:56:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-19 00:56:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-19 00:56:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:56:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:56:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:56:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:56:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:56:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:56:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 00:56:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-19 00:56:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-19 00:56:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-19 00:56:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-19 00:56:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-19 00:56:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-19 00:56:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:56:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:56:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-19 00:56:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:56:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:56:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:56:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:56:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:56:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:56:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 00:56:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-19 00:56:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-19 00:56:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-19 00:56:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-19 00:56:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-19 00:56:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-19 00:56:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:56:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:56:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:56:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:56:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:56:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:56:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-19 00:56:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-19 00:56:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-19 00:56:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-19 00:56:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-19 00:56:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-19 00:56:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-19 00:56:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:56:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:56:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:56:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:56:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:56:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:56:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-19 00:56:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-19 00:56:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-19 00:56:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-19 00:56:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-19 00:56:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-19 00:56:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-19 00:56:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:56:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:56:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:56:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:56:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:56:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:56:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 00:56:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-19 00:56:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-19 00:56:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-19 00:56:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-19 00:56:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-19 00:56:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-19 00:56:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:56:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:56:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:56:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:56:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:56:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:56:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 00:56:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-19 00:56:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-19 00:56:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-19 00:56:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-19 00:56:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-19 00:56:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-19 00:56:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:56:38,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:56:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:56:38,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:56:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:56:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:56:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:56:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:56:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:56:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:56:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 00:56:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 00:56:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 00:56:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-19 00:56:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:56:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-19 00:56:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-19 00:56:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-19 00:56:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-19 00:56:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-19 00:56:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-19 00:56:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-19 00:56:38,994 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:56:38,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:56:40,334 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-19 00:56:40,334 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:56:40,354 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:56:40,356 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:56:40,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:56:40 BoogieIcfgContainer [2024-11-19 00:56:40,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:56:40,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:56:40,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:56:40,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:56:40,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:56:37" (1/3) ... [2024-11-19 00:56:40,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b4d00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:56:40, skipping insertion in model container [2024-11-19 00:56:40,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:38" (2/3) ... [2024-11-19 00:56:40,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b4d00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:56:40, skipping insertion in model container [2024-11-19 00:56:40,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:56:40" (3/3) ... [2024-11-19 00:56:40,367 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-39.i [2024-11-19 00:56:40,386 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:56:40,387 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:56:40,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:56:40,471 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@47cae0fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:56:40,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:56:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:56:40,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:40,490 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:40,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:40,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1102926622, now seen corresponding path program 1 times [2024-11-19 00:56:40,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:40,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341800929] [2024-11-19 00:56:40,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:40,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:40,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:40,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:56:40,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:56:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:40,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:56:41,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-11-19 00:56:41,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:41,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:41,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341800929] [2024-11-19 00:56:41,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341800929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:41,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:41,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:56:41,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899412023] [2024-11-19 00:56:41,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:41,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:56:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:41,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:56:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:56:41,110 INFO L87 Difference]: Start difference. First operand has 114 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:56:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:41,158 INFO L93 Difference]: Finished difference Result 221 states and 348 transitions. [2024-11-19 00:56:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:56:41,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-11-19 00:56:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:41,169 INFO L225 Difference]: With dead ends: 221 [2024-11-19 00:56:41,169 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 00:56:41,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:56:41,177 INFO L432 NwaCegarLoop]: 162 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, 162 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:41,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 00:56:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 00:56:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:56:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2024-11-19 00:56:41,246 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 126 [2024-11-19 00:56:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:41,248 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2024-11-19 00:56:41,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:56:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2024-11-19 00:56:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:56:41,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:41,252 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:41,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:41,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:41,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:41,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash -405452762, now seen corresponding path program 1 times [2024-11-19 00:56:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:41,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478606080] [2024-11-19 00:56:41,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:41,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:41,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:41,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:56:41,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (3)] Waiting until timeout for monitored process [2024-11-19 00:56:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:41,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-19 00:56:41,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:49,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 00:56:50,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:56:50,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2024-11-19 00:56:50,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-19 00:56:51,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2024-11-19 00:56:51,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-19 00:56:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 20 proven. 348 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:56:51,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:56:53,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:53,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478606080] [2024-11-19 00:56:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478606080] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:53,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:56:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [45] total 53 [2024-11-19 00:56:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785272515] [2024-11-19 00:56:53,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:53,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:56:53,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:56:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2562, Unknown=0, NotChecked=0, Total=2756 [2024-11-19 00:56:53,160 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:55,715 INFO L93 Difference]: Finished difference Result 315 states and 462 transitions. [2024-11-19 00:56:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:56:55,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-19 00:56:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:55,722 INFO L225 Difference]: With dead ends: 315 [2024-11-19 00:56:55,725 INFO L226 Difference]: Without dead ends: 208 [2024-11-19 00:56:55,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=244, Invalid=2948, Unknown=0, NotChecked=0, Total=3192 [2024-11-19 00:56:55,730 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 202 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:55,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1014 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 00:56:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-19 00:56:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 158. [2024-11-19 00:56:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 135 states have (on average 1.4074074074074074) internal successors, (190), 136 states have internal predecessors, (190), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:56:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2024-11-19 00:56:55,753 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 230 transitions. Word has length 126 [2024-11-19 00:56:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:55,754 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-11-19 00:56:55,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:56:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 230 transitions. [2024-11-19 00:56:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:56:55,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:55,757 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:55,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (3)] Ended with exit code 0 [2024-11-19 00:56:55,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:55,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:55,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:55,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1085511132, now seen corresponding path program 1 times [2024-11-19 00:56:55,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:55,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909214622] [2024-11-19 00:56:55,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:55,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:56:55,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:55,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:56:55,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (4)] Waiting until timeout for monitored process [2024-11-19 00:56:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:56,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-19 00:56:56,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:02,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2024-11-19 00:57:03,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:57:03,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-19 00:57:03,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2024-11-19 00:57:03,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-19 00:57:03,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 65 [2024-11-19 00:57:03,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-19 00:57:04,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 68 [2024-11-19 00:57:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 20 proven. 348 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:57:04,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:57:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:57:07,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:07,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909214622] [2024-11-19 00:57:07,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909214622] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:07,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:57:07,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [47] total 56 [2024-11-19 00:57:07,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109630736] [2024-11-19 00:57:07,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:07,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:57:07,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:07,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:57:07,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2024-11-19 00:57:07,017 INFO L87 Difference]: Start difference. First operand 158 states and 230 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:57:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:57:11,309 INFO L93 Difference]: Finished difference Result 364 states and 530 transitions. [2024-11-19 00:57:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:57:11,311 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-19 00:57:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:57:11,314 INFO L225 Difference]: With dead ends: 364 [2024-11-19 00:57:11,314 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 00:57:11,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=257, Invalid=3649, Unknown=0, NotChecked=0, Total=3906 [2024-11-19 00:57:11,318 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 153 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:57:11,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1387 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 00:57:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 00:57:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 158. [2024-11-19 00:57:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 135 states have (on average 1.4) internal successors, (189), 136 states have internal predecessors, (189), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:57:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2024-11-19 00:57:11,333 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 126 [2024-11-19 00:57:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:57:11,333 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2024-11-19 00:57:11,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:57:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2024-11-19 00:57:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:57:11,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:11,336 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:57:11,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 00:57:11,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:57:11,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:11,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1685316440, now seen corresponding path program 1 times [2024-11-19 00:57:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129134718] [2024-11-19 00:57:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:11,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:57:11,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:11,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:57:11,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (5)] Waiting until timeout for monitored process [2024-11-19 00:57:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:11,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 00:57:11,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:15,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2024-11-19 00:57:15,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-19 00:57:15,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2024-11-19 00:57:15,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-19 00:57:15,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2024-11-19 00:57:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 24 proven. 338 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-19 00:57:16,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:57:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:57:17,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:17,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129134718] [2024-11-19 00:57:17,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129134718] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:57:17,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:57:17,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [36] total 43 [2024-11-19 00:57:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500907972] [2024-11-19 00:57:17,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:17,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:57:17,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:57:17,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:57:17,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1665, Unknown=0, NotChecked=0, Total=1806 [2024-11-19 00:57:17,260 INFO L87 Difference]: Start difference. First operand 158 states and 229 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)