./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-30.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dc45ea9668aac6e48de27a922a21b6f1fcfad793474bb275ed2ea7566fcf986e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:36:43,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:36:43,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:36:43,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:36:43,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:36:43,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:36:43,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:36:43,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:36:43,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:36:43,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:36:43,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:36:43,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:36:43,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:36:43,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:36:43,404 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:36:43,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:36:43,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:36:43,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:36:43,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:36:43,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:36:43,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:36:43,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:36:43,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:36:43,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:36:43,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:36:43,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:36:43,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:36:43,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:36:43,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:36:43,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:36:43,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:36:43,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:36:43,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:36:43,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:36:43,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:36:43,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:36:43,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:36:43,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:36:43,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:36:43,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:36:43,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:36:43,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:36:43,411 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-clean/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-clean/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 -> dc45ea9668aac6e48de27a922a21b6f1fcfad793474bb275ed2ea7566fcf986e [2024-10-11 13:36:43,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:36:43,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:36:43,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:36:43,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:36:43,696 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:36:43,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-30.i [2024-10-11 13:36:45,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:36:45,274 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:36:45,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-30.i [2024-10-11 13:36:45,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/91cd1fd36/f725d49573154aad812cefbd65567cc0/FLAGb1ea3f6f7 [2024-10-11 13:36:45,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/91cd1fd36/f725d49573154aad812cefbd65567cc0 [2024-10-11 13:36:45,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:36:45,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:36:45,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:36:45,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:36:45,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:36:45,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:45" (1/1) ... [2024-10-11 13:36:45,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c313357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:45, skipping insertion in model container [2024-10-11 13:36:45,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:45" (1/1) ... [2024-10-11 13:36:45,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:36:45,839 WARN L248 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-30.i[916,929] [2024-10-11 13:36:45,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:36:45,945 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:36:45,956 WARN L248 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-30.i[916,929] [2024-10-11 13:36:45,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:36:46,020 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:36:46,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46 WrapperNode [2024-10-11 13:36:46,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:36:46,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:36:46,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:36:46,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:36:46,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,097 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 553 [2024-10-11 13:36:46,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:36:46,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:36:46,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:36:46,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:36:46,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,156 INFO L175 MemorySlicer]: Split 139 memory accesses to 14 slices as follows [2, 17, 8, 11, 11, 12, 14, 14, 10, 5, 14, 8, 10, 3]. 12 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1]. [2024-10-11 13:36:46,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:36:46,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:36:46,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:36:46,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:36:46,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (1/1) ... [2024-10-11 13:36:46,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:36:46,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:36:46,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:36:46,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:36:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:36:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:36:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:36:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:36:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:36:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:36:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:36:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:36:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:36:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:36:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:36:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:36:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-11 13:36:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-11 13:36:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-11 13:36:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:36:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:36:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:36:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:36:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:36:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:36:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:36:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:36:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:36:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:36:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:36:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:36:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:36:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 13:36:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:36:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:36:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:36:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:36:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:36:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:36:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:36:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:36:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:36:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:36:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:36:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-11 13:36:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-11 13:36:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-11 13:36:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:36:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:36:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:36:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:36:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:36:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:36:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:36:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:36:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:36:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:36:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:36:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:36:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:36:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 13:36:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:36:46,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:36:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:36:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:36:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:36:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:36:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:36:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:36:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:36:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:36:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:36:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-11 13:36:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-11 13:36:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-11 13:36:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:36:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:36:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:36:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:36:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:36:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 13:36:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:36:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:36:46,570 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:36:46,572 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:36:47,178 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2024-10-11 13:36:47,179 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:36:47,233 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:36:47,233 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:36:47,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:47 BoogieIcfgContainer [2024-10-11 13:36:47,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:36:47,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:36:47,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:36:47,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:36:47,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:36:45" (1/3) ... [2024-10-11 13:36:47,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d964368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:47, skipping insertion in model container [2024-10-11 13:36:47,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:46" (2/3) ... [2024-10-11 13:36:47,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d964368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:47, skipping insertion in model container [2024-10-11 13:36:47,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:47" (3/3) ... [2024-10-11 13:36:47,247 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-30.i [2024-10-11 13:36:47,265 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:36:47,266 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:36:47,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:36:47,340 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;@747281ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:36:47,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:36:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:36:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:36:47,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:47,361 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:47,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:47,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:47,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1595619959, now seen corresponding path program 1 times [2024-10-11 13:36:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:47,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118795201] [2024-10-11 13:36:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:47,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118795201] [2024-10-11 13:36:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118795201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:47,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:47,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:36:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380508058] [2024-10-11 13:36:47,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:47,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:36:47,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:36:47,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:36:47,893 INFO L87 Difference]: Start difference. First operand has 112 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:36:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:47,941 INFO L93 Difference]: Finished difference Result 221 states and 349 transitions. [2024-10-11 13:36:47,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:36:47,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2024-10-11 13:36:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:47,952 INFO L225 Difference]: With dead ends: 221 [2024-10-11 13:36:47,953 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 13:36:47,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:36:47,960 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:47,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 13:36:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 13:36:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 91 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:36:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2024-10-11 13:36:48,014 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 132 [2024-10-11 13:36:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:48,015 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2024-10-11 13:36:48,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:36:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2024-10-11 13:36:48,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:36:48,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:48,021 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:48,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:36:48,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:48,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1882276195, now seen corresponding path program 1 times [2024-10-11 13:36:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:48,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968852302] [2024-10-11 13:36:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:49,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968852302] [2024-10-11 13:36:49,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968852302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:49,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:49,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:36:49,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559967975] [2024-10-11 13:36:49,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:36:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:49,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:36:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:49,307 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:49,743 INFO L93 Difference]: Finished difference Result 366 states and 532 transitions. [2024-10-11 13:36:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:36:49,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-11 13:36:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:49,751 INFO L225 Difference]: With dead ends: 366 [2024-10-11 13:36:49,751 INFO L226 Difference]: Without dead ends: 257 [2024-10-11 13:36:49,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:36:49,755 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 204 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:49,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 577 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:36:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-11 13:36:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 188. [2024-10-11 13:36:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 156 states have (on average 1.391025641025641) internal successors, (217), 157 states have internal predecessors, (217), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:36:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 275 transitions. [2024-10-11 13:36:49,788 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 275 transitions. Word has length 132 [2024-10-11 13:36:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:49,791 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 275 transitions. [2024-10-11 13:36:49,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 275 transitions. [2024-10-11 13:36:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:36:49,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:49,794 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:49,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:36:49,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:49,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:49,797 INFO L85 PathProgramCache]: Analyzing trace with hash 475805665, now seen corresponding path program 1 times [2024-10-11 13:36:49,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:49,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29250539] [2024-10-11 13:36:49,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:50,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:50,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29250539] [2024-10-11 13:36:50,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29250539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:50,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:50,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882226809] [2024-10-11 13:36:50,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:50,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:50,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:50,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:50,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:50,360 INFO L87 Difference]: Start difference. First operand 188 states and 275 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:50,519 INFO L93 Difference]: Finished difference Result 380 states and 554 transitions. [2024-10-11 13:36:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:50,520 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 13:36:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:50,523 INFO L225 Difference]: With dead ends: 380 [2024-10-11 13:36:50,523 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 13:36:50,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:36:50,525 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 101 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:50,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 736 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 13:36:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2024-10-11 13:36:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 158 states have (on average 1.3860759493670887) internal successors, (219), 159 states have internal predecessors, (219), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:36:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 277 transitions. [2024-10-11 13:36:50,557 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 277 transitions. Word has length 133 [2024-10-11 13:36:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:50,559 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 277 transitions. [2024-10-11 13:36:50,559 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 277 transitions. [2024-10-11 13:36:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:36:50,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:50,564 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:50,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:36:50,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:50,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:50,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1966335890, now seen corresponding path program 1 times [2024-10-11 13:36:50,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:50,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627799207] [2024-10-11 13:36:50,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:50,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:50,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:50,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627799207] [2024-10-11 13:36:50,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627799207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:50,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:50,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:50,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525116162] [2024-10-11 13:36:50,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:50,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:50,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:50,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:50,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:50,905 INFO L87 Difference]: Start difference. First operand 190 states and 277 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:50,984 INFO L93 Difference]: Finished difference Result 382 states and 555 transitions. [2024-10-11 13:36:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:50,985 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 13:36:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:50,990 INFO L225 Difference]: With dead ends: 382 [2024-10-11 13:36:50,990 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 13:36:50,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-10-11 13:36:50,992 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 71 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:50,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 790 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 13:36:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2024-10-11 13:36:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 158 states have (on average 1.379746835443038) internal successors, (218), 159 states have internal predecessors, (218), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:36:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 276 transitions. [2024-10-11 13:36:51,018 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 276 transitions. Word has length 133 [2024-10-11 13:36:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:51,018 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 276 transitions. [2024-10-11 13:36:51,018 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 276 transitions. [2024-10-11 13:36:51,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:36:51,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:51,020 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:51,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:36:51,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:51,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1147766602, now seen corresponding path program 1 times [2024-10-11 13:36:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:51,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348960276] [2024-10-11 13:36:51,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:51,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:51,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:51,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348960276] [2024-10-11 13:36:51,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348960276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:51,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:51,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:36:51,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22407204] [2024-10-11 13:36:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:51,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:36:51,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:51,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:36:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:36:51,831 INFO L87 Difference]: Start difference. First operand 190 states and 276 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:51,995 INFO L93 Difference]: Finished difference Result 527 states and 759 transitions. [2024-10-11 13:36:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:36:51,996 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-11 13:36:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:51,998 INFO L225 Difference]: With dead ends: 527 [2024-10-11 13:36:51,998 INFO L226 Difference]: Without dead ends: 338 [2024-10-11 13:36:51,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 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-10-11 13:36:52,002 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 94 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:52,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 876 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-11 13:36:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 225. [2024-10-11 13:36:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 193 states have (on average 1.378238341968912) internal successors, (266), 194 states have internal predecessors, (266), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:36:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 324 transitions. [2024-10-11 13:36:52,027 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 324 transitions. Word has length 135 [2024-10-11 13:36:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:52,028 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 324 transitions. [2024-10-11 13:36:52,028 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 324 transitions. [2024-10-11 13:36:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:36:52,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:52,031 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:52,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:36:52,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:52,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:52,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1152934179, now seen corresponding path program 1 times [2024-10-11 13:36:52,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:52,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104712021] [2024-10-11 13:36:52,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:52,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:52,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104712021] [2024-10-11 13:36:52,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104712021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:52,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:52,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:52,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675455429] [2024-10-11 13:36:52,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:52,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:52,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:52,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:52,287 INFO L87 Difference]: Start difference. First operand 225 states and 324 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:52,337 INFO L93 Difference]: Finished difference Result 458 states and 659 transitions. [2024-10-11 13:36:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:52,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-11 13:36:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:52,340 INFO L225 Difference]: With dead ends: 458 [2024-10-11 13:36:52,340 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 13:36:52,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:52,342 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:52,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 13:36:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2024-10-11 13:36:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 198 states have (on average 1.3686868686868687) internal successors, (271), 199 states have internal predecessors, (271), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:36:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 329 transitions. [2024-10-11 13:36:52,355 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 329 transitions. Word has length 135 [2024-10-11 13:36:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:52,355 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 329 transitions. [2024-10-11 13:36:52,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 329 transitions. [2024-10-11 13:36:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:36:52,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:52,357 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:52,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:36:52,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:52,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash 122310025, now seen corresponding path program 1 times [2024-10-11 13:36:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:52,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862900297] [2024-10-11 13:36:52,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:52,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:53,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:53,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862900297] [2024-10-11 13:36:53,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862900297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:53,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:53,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 13:36:53,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673947906] [2024-10-11 13:36:53,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:53,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:36:53,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:53,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:36:53,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:36:53,481 INFO L87 Difference]: Start difference. First operand 230 states and 329 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-11 13:36:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:54,451 INFO L93 Difference]: Finished difference Result 639 states and 903 transitions. [2024-10-11 13:36:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:36:54,452 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 135 [2024-10-11 13:36:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:54,455 INFO L225 Difference]: With dead ends: 639 [2024-10-11 13:36:54,456 INFO L226 Difference]: Without dead ends: 410 [2024-10-11 13:36:54,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:36:54,458 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 454 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:54,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1674 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:36:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-11 13:36:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 288. [2024-10-11 13:36:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 244 states have (on average 1.3524590163934427) internal successors, (330), 247 states have internal predecessors, (330), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 13:36:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 408 transitions. [2024-10-11 13:36:54,484 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 408 transitions. Word has length 135 [2024-10-11 13:36:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:54,484 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 408 transitions. [2024-10-11 13:36:54,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-11 13:36:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 408 transitions. [2024-10-11 13:36:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:36:54,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:54,486 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:54,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:36:54,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:54,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:54,487 INFO L85 PathProgramCache]: Analyzing trace with hash -888807225, now seen corresponding path program 1 times [2024-10-11 13:36:54,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:54,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76360002] [2024-10-11 13:36:54,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:54,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:55,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:55,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76360002] [2024-10-11 13:36:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76360002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:55,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:55,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:36:55,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437357611] [2024-10-11 13:36:55,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:55,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:36:55,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:55,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:36:55,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:36:55,079 INFO L87 Difference]: Start difference. First operand 288 states and 408 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:55,563 INFO L93 Difference]: Finished difference Result 789 states and 1105 transitions. [2024-10-11 13:36:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:36:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-11 13:36:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:55,566 INFO L225 Difference]: With dead ends: 789 [2024-10-11 13:36:55,566 INFO L226 Difference]: Without dead ends: 512 [2024-10-11 13:36:55,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:36:55,568 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 273 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:55,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1227 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:36:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-11 13:36:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 288. [2024-10-11 13:36:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 244 states have (on average 1.3442622950819672) internal successors, (328), 247 states have internal predecessors, (328), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 13:36:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 406 transitions. [2024-10-11 13:36:55,597 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 406 transitions. Word has length 135 [2024-10-11 13:36:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:55,598 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 406 transitions. [2024-10-11 13:36:55,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 406 transitions. [2024-10-11 13:36:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 13:36:55,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:55,600 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:55,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:36:55,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:55,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:55,600 INFO L85 PathProgramCache]: Analyzing trace with hash 928010568, now seen corresponding path program 1 times [2024-10-11 13:36:55,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:55,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294496511] [2024-10-11 13:36:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294496511] [2024-10-11 13:36:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294496511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:55,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:55,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57899576] [2024-10-11 13:36:55,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:55,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:55,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:55,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:55,917 INFO L87 Difference]: Start difference. First operand 288 states and 406 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:56,053 INFO L93 Difference]: Finished difference Result 572 states and 798 transitions. [2024-10-11 13:36:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:56,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-11 13:36:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:56,056 INFO L225 Difference]: With dead ends: 572 [2024-10-11 13:36:56,056 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 13:36:56,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-10-11 13:36:56,058 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 64 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:56,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 582 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 13:36:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 248. [2024-10-11 13:36:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 214 states have (on average 1.3457943925233644) internal successors, (288), 215 states have internal predecessors, (288), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:36:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 346 transitions. [2024-10-11 13:36:56,117 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 346 transitions. Word has length 137 [2024-10-11 13:36:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:56,117 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 346 transitions. [2024-10-11 13:36:56,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 346 transitions. [2024-10-11 13:36:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 13:36:56,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:56,120 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:56,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:36:56,120 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:56,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash 679868697, now seen corresponding path program 1 times [2024-10-11 13:36:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889781963] [2024-10-11 13:36:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889781963] [2024-10-11 13:36:56,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889781963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:56,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:56,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:36:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920524987] [2024-10-11 13:36:56,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:56,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:36:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:56,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:36:56,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:36:56,636 INFO L87 Difference]: Start difference. First operand 248 states and 346 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:56,854 INFO L93 Difference]: Finished difference Result 652 states and 902 transitions. [2024-10-11 13:36:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:36:56,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-11 13:36:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:56,857 INFO L225 Difference]: With dead ends: 652 [2024-10-11 13:36:56,857 INFO L226 Difference]: Without dead ends: 405 [2024-10-11 13:36:56,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:36:56,858 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 88 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:56,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1260 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:36:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-11 13:36:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2024-10-11 13:36:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 343 states have (on average 1.3236151603498543) internal successors, (454), 346 states have internal predecessors, (454), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-11 13:36:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 552 transitions. [2024-10-11 13:36:56,893 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 552 transitions. Word has length 137 [2024-10-11 13:36:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:56,893 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 552 transitions. [2024-10-11 13:36:56,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 552 transitions. [2024-10-11 13:36:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 13:36:56,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:56,895 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:56,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:36:56,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:56,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash 753206299, now seen corresponding path program 1 times [2024-10-11 13:36:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:56,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242197763] [2024-10-11 13:36:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:36:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:36:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:36:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:36:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:36:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:36:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:36:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:36:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:36:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:36:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:36:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:36:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:36:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:36:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:36:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:36:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:36:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:36:57,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:36:57,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242197763] [2024-10-11 13:36:57,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242197763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:57,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:57,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:57,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972907118] [2024-10-11 13:36:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:57,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:57,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:36:57,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:57,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:57,095 INFO L87 Difference]: Start difference. First operand 401 states and 552 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:57,174 INFO L93 Difference]: Finished difference Result 802 states and 1101 transitions. [2024-10-11 13:36:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:57,175 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-11 13:36:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:57,177 INFO L225 Difference]: With dead ends: 802 [2024-10-11 13:36:57,177 INFO L226 Difference]: Without dead ends: 402 [2024-10-11 13:36:57,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-10-11 13:36:57,179 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 65 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:57,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 608 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-11 13:36:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 366. [2024-10-11 13:36:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 308 states have (on average 1.3116883116883118) internal successors, (404), 311 states have internal predecessors, (404), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-11 13:36:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 502 transitions. [2024-10-11 13:36:57,213 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 502 transitions. Word has length 138 [2024-10-11 13:36:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:57,214 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 502 transitions. [2024-10-11 13:36:57,214 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:36:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 502 transitions. [2024-10-11 13:36:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:36:57,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:57,216 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:57,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:36:57,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:57,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1051603663, now seen corresponding path program 1 times [2024-10-11 13:36:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:36:57,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524608779] [2024-10-11 13:36:57,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:57,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:36:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:36:57,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654366721] [2024-10-11 13:36:57,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:57,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:36:57,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:36:57,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:36:57,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:36:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:36:57,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:36:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:36:58,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:36:58,072 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:36:58,073 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:36:58,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:36:58,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 13:36:58,282 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:36:58,459 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:36:58,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:36:58 BoogieIcfgContainer [2024-10-11 13:36:58,463 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:36:58,464 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:36:58,464 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:36:58,464 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:36:58,464 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:47" (3/4) ... [2024-10-11 13:36:58,466 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:36:58,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:36:58,468 INFO L158 Benchmark]: Toolchain (without parser) took 12836.57ms. Allocated memory was 153.1MB in the beginning and 402.7MB in the end (delta: 249.6MB). Free memory was 98.0MB in the beginning and 310.1MB in the end (delta: -212.2MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-10-11 13:36:58,468 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:36:58,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.84ms. Allocated memory is still 153.1MB. Free memory was 97.6MB in the beginning and 81.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:36:58,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.64ms. Allocated memory is still 153.1MB. Free memory was 81.6MB in the beginning and 77.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:36:58,469 INFO L158 Benchmark]: Boogie Preprocessor took 134.96ms. Allocated memory is still 153.1MB. Free memory was 77.0MB in the beginning and 70.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:36:58,470 INFO L158 Benchmark]: RCFGBuilder took 999.70ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 70.7MB in the beginning and 145.5MB in the end (delta: -74.8MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-10-11 13:36:58,470 INFO L158 Benchmark]: TraceAbstraction took 11227.01ms. Allocated memory was 224.4MB in the beginning and 402.7MB in the end (delta: 178.3MB). Free memory was 144.4MB in the beginning and 310.1MB in the end (delta: -165.7MB). Peak memory consumption was 194.0MB. Max. memory is 16.1GB. [2024-10-11 13:36:58,470 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 402.7MB. Free memory is still 310.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:36:58,472 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.18ms. Allocated memory is still 153.1MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.84ms. Allocated memory is still 153.1MB. Free memory was 97.6MB in the beginning and 81.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.64ms. Allocated memory is still 153.1MB. Free memory was 81.6MB in the beginning and 77.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.96ms. Allocated memory is still 153.1MB. Free memory was 77.0MB in the beginning and 70.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 999.70ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 70.7MB in the beginning and 145.5MB in the end (delta: -74.8MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11227.01ms. Allocated memory was 224.4MB in the beginning and 402.7MB in the end (delta: 178.3MB). Free memory was 144.4MB in the beginning and 310.1MB in the end (delta: -165.7MB). Peak memory consumption was 194.0MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 402.7MB. Free memory is still 310.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someUnaryFLOAToperation at line 116, overapproximation of someBinaryArithmeticFLOAToperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 64; [L22] unsigned char var_1_1 = 64; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] signed short int var_1_5 = 8; [L26] signed short int var_1_5 = 8; [L27] signed short int* var_1_5_Pointer = &(var_1_5); [L28] signed short int var_1_6 = -32; [L28] signed short int var_1_6 = -32; [L29] signed short int* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_7 = 128; [L30] unsigned char var_1_7 = 128; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_8 = 10; [L32] unsigned char var_1_8 = 10; [L33] unsigned char* var_1_8_Pointer = &(var_1_8); [L34] unsigned char var_1_9 = 2; [L34] unsigned char var_1_9 = 2; [L35] unsigned char* var_1_9_Pointer = &(var_1_9); [L36] signed long int var_1_10 = 0; [L36] signed long int var_1_10 = 0; [L37] signed long int* var_1_10_Pointer = &(var_1_10); [L38] float var_1_11 = 32.5; [L38] float var_1_11 = 32.5; [L39] float* var_1_11_Pointer = &(var_1_11); [L40] float var_1_13 = 127.8; [L40] float var_1_13 = 127.8; [L41] float* var_1_13_Pointer = &(var_1_13); [L42] float var_1_14 = 999.25; [L42] float var_1_14 = 999.25; [L43] float* var_1_14_Pointer = &(var_1_14); [L44] float var_1_15 = 1000000000.5; [L44] float var_1_15 = 1000000000.5; [L45] float* var_1_15_Pointer = &(var_1_15); [L46] float var_1_16 = 256.6; [L46] float var_1_16 = 256.6; [L47] float* var_1_16_Pointer = &(var_1_16); [L48] signed long int last_1_var_1_10 = 0; [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L113] EXPR \read(var_1_10) [L113] last_1_var_1_10 = var_1_10 [L123] RET updateLastVariables() [L124] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_5 = __VERIFIER_nondet_short() [L89] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_6 = __VERIFIER_nondet_short() [L93] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] var_1_7 = __VERIFIER_nondet_uchar() [L97] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] var_1_8 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] var_1_9 = __VERIFIER_nondet_uchar() [L103] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] var_1_13 = __VERIFIER_nondet_float() [L106] EXPR \read(var_1_13) [L106] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F [L106] EXPR \read(var_1_13) [L106] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] var_1_14 = __VERIFIER_nondet_float() [L108] EXPR \read(var_1_14) [L108] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F [L108] EXPR \read(var_1_14) [L108] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L109] var_1_15 = __VERIFIER_nondet_float() [L110] EXPR \read(var_1_15) [L110] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L110] EXPR \read(var_1_15) [L110] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L124] RET updateVariables() [L125] CALL step() [L52] EXPR \read(*var_1_5_Pointer) [L52] EXPR \read(*var_1_6_Pointer) [L52] signed long int stepLocal_0 = (last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)); [L53] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L53] COND FALSE !((*(var_1_2_Pointer))) [L58] EXPR \read(*var_1_9_Pointer) [L58] (*(var_1_1_Pointer)) = (*(var_1_9_Pointer)) [L60] EXPR \read(*var_1_1_Pointer) [L60] unsigned char stepLocal_2 = (*(var_1_1_Pointer)); [L61] EXPR \read(*var_1_1_Pointer) [L61] EXPR \read(*var_1_1_Pointer) [L61] signed long int stepLocal_1 = (*(var_1_1_Pointer)) + (*(var_1_1_Pointer)); [L62] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND FALSE !(stepLocal_1 < (*(var_1_6_Pointer))) [L71] EXPR \read(*var_1_9_Pointer) [L71] (*(var_1_10_Pointer)) = (*(var_1_9_Pointer)) [L73] EXPR \read(*var_1_1_Pointer) [L73] unsigned char stepLocal_4 = (*(var_1_1_Pointer)); [L74] EXPR \read(*var_1_9_Pointer) [L74] EXPR \read(*var_1_5_Pointer) [L74] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] EXPR ((*(var_1_9_Pointer)) / (*(var_1_5_Pointer))) << (*(var_1_6_Pointer)) VAL [isInitial=1, last_1_var_1_10=0, stepLocal_0=0, stepLocal_2=261, stepLocal_4=261, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] signed long int stepLocal_3 = ((*(var_1_9_Pointer)) / (*(var_1_5_Pointer))) << (*(var_1_6_Pointer)); [L75] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L75] COND FALSE !(stepLocal_4 > (*(var_1_10_Pointer))) [L80] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] EXPR (((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))) [L80] EXPR \read(*var_1_13_Pointer) [L80] EXPR (((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))) VAL [isInitial=1, last_1_var_1_10=0, stepLocal_0=0, stepLocal_2=261, stepLocal_3=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] EXPR \read(*var_1_15_Pointer) [L80] (*(var_1_11_Pointer)) = ((((((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))))) - (*(var_1_15_Pointer))) [L82] EXPR \read(*var_1_15_Pointer) [L82] (*(var_1_16_Pointer)) = (*(var_1_15_Pointer)) [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR (*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) [L116] EXPR \read(*var_1_1_Pointer) [L116] EXPR \read(*var_1_9_Pointer) [L116] EXPR (*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer)))) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR ((*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR ((*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) [L116] EXPR \read(*var_1_1_Pointer) [L116] EXPR \read(*var_1_1_Pointer) [L116] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR (((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer)))) [L116] EXPR \read(*var_1_10_Pointer) [L116] EXPR \read(*var_1_9_Pointer) [L116] EXPR (((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer)))) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR ((*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR (((*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer)))))) && (((*(var_1_1_Pointer)) > (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) <= (((*(var_1_9_Pointer)) / (*(var_1_5_Pointer))) << (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : 1) : ((*(var_1_11_Pointer)) == ((float) ((((((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))))) - (*(var_1_15_Pointer)))))) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR (((*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer)))))) && (((*(var_1_1_Pointer)) > (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) <= (((*(var_1_9_Pointer)) / (*(var_1_5_Pointer))) << (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : 1) : ((*(var_1_11_Pointer)) == ((float) ((((((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))))) - (*(var_1_15_Pointer)))))) [L116] EXPR \read(*var_1_1_Pointer) [L116] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR ((*(var_1_1_Pointer)) > (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) <= (((*(var_1_9_Pointer)) / (*(var_1_5_Pointer))) << (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : 1) : ((*(var_1_11_Pointer)) == ((float) ((((((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))))) - (*(var_1_15_Pointer))))) [L116] EXPR \read(*var_1_11_Pointer) [L116] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR (((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))) [L116] EXPR \read(*var_1_13_Pointer) [L116] EXPR (((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR \read(*var_1_15_Pointer) [L116] EXPR ((*(var_1_1_Pointer)) > (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) <= (((*(var_1_9_Pointer)) / (*(var_1_5_Pointer))) << (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : 1) : ((*(var_1_11_Pointer)) == ((float) ((((((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))))) - (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR (((*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer)))))) && (((*(var_1_1_Pointer)) > (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) <= (((*(var_1_9_Pointer)) / (*(var_1_5_Pointer))) << (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : 1) : ((*(var_1_11_Pointer)) == ((float) ((((((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))))) - (*(var_1_15_Pointer)))))) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR ((((*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer)))))) && (((*(var_1_1_Pointer)) > (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) <= (((*(var_1_9_Pointer)) / (*(var_1_5_Pointer))) << (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : 1) : ((*(var_1_11_Pointer)) == ((float) ((((((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))))) - (*(var_1_15_Pointer))))))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_15_Pointer)))) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR ((((*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer)))))) && (((*(var_1_1_Pointer)) > (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) <= (((*(var_1_9_Pointer)) / (*(var_1_5_Pointer))) << (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : 1) : ((*(var_1_11_Pointer)) == ((float) ((((((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))))) - (*(var_1_15_Pointer))))))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_15_Pointer)))) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116-L117] return ((((*(var_1_2_Pointer)) ? ((last_1_var_1_10 > ((last_1_var_1_10 / (*(var_1_5_Pointer))) % (*(var_1_6_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) > ((*(var_1_9_Pointer)))) ? ((((((*(var_1_7_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_8_Pointer)))))) : ((*(var_1_9_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_9_Pointer))))) && ((((*(var_1_1_Pointer)) + (*(var_1_1_Pointer))) < (*(var_1_6_Pointer))) ? ((*(var_1_2_Pointer)) ? (((*(var_1_5_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_9_Pointer)))))) && (((*(var_1_1_Pointer)) > (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) <= (((*(var_1_9_Pointer)) / (*(var_1_5_Pointer))) << (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (*(var_1_14_Pointer))))) : 1) : ((*(var_1_11_Pointer)) == ((float) ((((((*(var_1_13_Pointer))) < 0 ) ? -((*(var_1_13_Pointer))) : ((*(var_1_13_Pointer))))) - (*(var_1_15_Pointer))))))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_15_Pointer)))) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16: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_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 12, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1414 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1414 mSDsluCounter, 9102 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7061 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1868 IncrementalHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 2041 mSDtfsCounter, 1868 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=401occurred in iteration=10, InterpolantAutomatonStates: 68, 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, 11 MinimizatonAttempts, 625 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1760 NumberOfCodeBlocks, 1760 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1471 ConstructedInterpolants, 0 QuantifiedInterpolants, 3596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 5984/5984 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:36:58,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-30.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dc45ea9668aac6e48de27a922a21b6f1fcfad793474bb275ed2ea7566fcf986e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:37:00,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:37:00,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:37:00,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:37:00,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:37:00,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:37:00,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:37:00,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:37:00,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:37:00,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:37:00,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:37:00,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:37:00,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:37:00,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:37:00,903 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:37:00,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:37:00,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:37:00,903 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:37:00,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:37:00,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:37:00,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:37:00,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:37:00,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:37:00,905 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:37:00,905 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:37:00,905 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:37:00,906 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:37:00,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:37:00,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:37:00,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:37:00,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:37:00,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:37:00,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:37:00,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:37:00,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:37:00,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:37:00,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:37:00,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:37:00,914 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:37:00,914 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:37:00,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:37:00,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:37:00,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:37:00,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:37:00,916 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:37:00,916 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-clean/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-clean/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 -> dc45ea9668aac6e48de27a922a21b6f1fcfad793474bb275ed2ea7566fcf986e [2024-10-11 13:37:01,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:37:01,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:37:01,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:37:01,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:37:01,256 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:37:01,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-30.i [2024-10-11 13:37:02,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:37:03,060 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:37:03,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-30.i [2024-10-11 13:37:03,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e3ea2a823/a701fa71cc394cf3b2e70239ec788eab/FLAGdf275b875 [2024-10-11 13:37:03,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e3ea2a823/a701fa71cc394cf3b2e70239ec788eab [2024-10-11 13:37:03,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:37:03,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:37:03,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:37:03,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:37:03,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:37:03,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:03,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fc2168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03, skipping insertion in model container [2024-10-11 13:37:03,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:03,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:37:03,628 WARN L248 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-30.i[916,929] [2024-10-11 13:37:03,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:37:03,730 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:37:03,743 WARN L248 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-30.i[916,929] [2024-10-11 13:37:03,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:37:03,824 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:37:03,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03 WrapperNode [2024-10-11 13:37:03,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:37:03,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:37:03,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:37:03,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:37:03,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:03,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:03,902 INFO L138 Inliner]: procedures = 36, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 538 [2024-10-11 13:37:03,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:37:03,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:37:03,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:37:03,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:37:03,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:03,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:03,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:03,975 INFO L175 MemorySlicer]: Split 139 memory accesses to 14 slices as follows [2, 17, 8, 11, 11, 12, 14, 14, 10, 5, 14, 8, 10, 3]. 12 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1]. [2024-10-11 13:37:03,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:03,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:04,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:04,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:04,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:04,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:04,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:37:04,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:37:04,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:37:04,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:37:04,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (1/1) ... [2024-10-11 13:37:04,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:37:04,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:37:04,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:37:04,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:37:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:37:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:37:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:37:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:37:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:37:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:37:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:37:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:37:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:37:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:37:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:37:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-11 13:37:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-11 13:37:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-11 13:37:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-11 13:37:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:37:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:37:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:37:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:37:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:37:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:37:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:37:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-11 13:37:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-11 13:37:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-11 13:37:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-11 13:37:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-11 13:37:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-11 13:37:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-11 13:37:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:37:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:37:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:37:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:37:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:37:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:37:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:37:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:37:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:37:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:37:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-11 13:37:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-11 13:37:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-11 13:37:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-11 13:37:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:37:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:37:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:37:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:37:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:37:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:37:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-11 13:37:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-11 13:37:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-11 13:37:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-11 13:37:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-11 13:37:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-10-11 13:37:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-10-11 13:37:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-10-11 13:37:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:37:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:37:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:37:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:37:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:37:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:37:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:37:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-11 13:37:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-11 13:37:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-11 13:37:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-11 13:37:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-11 13:37:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-11 13:37:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-11 13:37:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:37:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:37:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:37:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:37:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:37:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:37:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-11 13:37:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-11 13:37:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-11 13:37:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-11 13:37:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-11 13:37:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-10-11 13:37:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-10-11 13:37:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-10-11 13:37:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:37:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:37:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:37:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:37:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:37:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:37:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:37:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 13:37:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 13:37:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 13:37:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-11 13:37:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-11 13:37:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-11 13:37:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-11 13:37:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:37:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:37:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:37:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:37:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:37:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:37:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:37:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-11 13:37:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-11 13:37:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-11 13:37:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-11 13:37:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-11 13:37:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-11 13:37:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-11 13:37:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:37:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:37:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:37:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:37:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:37:04,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:37:04,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:37:04,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-11 13:37:04,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-11 13:37:04,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-11 13:37:04,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-11 13:37:04,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-11 13:37:04,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-11 13:37:04,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-11 13:37:04,157 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:37:04,157 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:37:04,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:37:04,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:37:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:37:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:37:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:37:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:37:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:37:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:37:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:37:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:37:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:37:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:37:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-11 13:37:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-11 13:37:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-11 13:37:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-11 13:37:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:37:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:37:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:37:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:37:04,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:37:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:37:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:37:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 13:37:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 13:37:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 13:37:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-11 13:37:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-11 13:37:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-11 13:37:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-11 13:37:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:37:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:37:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:37:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:37:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:37:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:37:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-11 13:37:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-11 13:37:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-11 13:37:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-11 13:37:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-11 13:37:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-10-11 13:37:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-10-11 13:37:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-10-11 13:37:04,417 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:37:04,420 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:37:05,508 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-10-11 13:37:05,508 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:37:05,580 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:37:05,580 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:37:05,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:37:05 BoogieIcfgContainer [2024-10-11 13:37:05,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:37:05,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:37:05,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:37:05,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:37:05,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:37:03" (1/3) ... [2024-10-11 13:37:05,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e920fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:37:05, skipping insertion in model container [2024-10-11 13:37:05,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:37:03" (2/3) ... [2024-10-11 13:37:05,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e920fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:37:05, skipping insertion in model container [2024-10-11 13:37:05,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:37:05" (3/3) ... [2024-10-11 13:37:05,588 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-30.i [2024-10-11 13:37:05,605 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:37:05,605 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:37:05,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:37:05,673 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;@47bf42ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:37:05,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:37:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:37:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:37:05,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:05,702 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:05,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:05,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash -653007772, now seen corresponding path program 1 times [2024-10-11 13:37:05,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:05,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815902234] [2024-10-11 13:37:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:05,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:05,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:05,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 13:37:05,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:37:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:06,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:37:06,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-11 13:37:06,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:06,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815902234] [2024-10-11 13:37:06,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815902234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:06,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:06,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:37:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811711230] [2024-10-11 13:37:06,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:06,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:37:06,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:06,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:37:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:37:06,365 INFO L87 Difference]: Start difference. First operand has 107 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:37:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:06,469 INFO L93 Difference]: Finished difference Result 211 states and 335 transitions. [2024-10-11 13:37:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:37:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-11 13:37:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:06,480 INFO L225 Difference]: With dead ends: 211 [2024-10-11 13:37:06,480 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 13:37:06,484 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-10-11 13:37:06,487 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:06,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:37:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 13:37:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 13:37:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:37:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-10-11 13:37:06,531 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 130 [2024-10-11 13:37:06,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:06,532 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-10-11 13:37:06,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:37:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-10-11 13:37:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:37:06,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:06,536 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:06,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:37:06,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 13:37:06,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:06,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1023818250, now seen corresponding path program 1 times [2024-10-11 13:37:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:06,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192214457] [2024-10-11 13:37:06,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:06,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:06,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:06,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 13:37:06,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:37:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:07,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:37:07,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:07,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:07,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192214457] [2024-10-11 13:37:07,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192214457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:07,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:07,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:37:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547478738] [2024-10-11 13:37:07,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:07,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:07,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:07,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:07,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:37:07,327 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:07,521 INFO L93 Difference]: Finished difference Result 214 states and 316 transitions. [2024-10-11 13:37:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:37:07,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-11 13:37:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:07,528 INFO L225 Difference]: With dead ends: 214 [2024-10-11 13:37:07,528 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 13:37:07,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:37:07,530 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:07,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:37:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 13:37:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-11 13:37:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:37:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-10-11 13:37:07,549 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 130 [2024-10-11 13:37:07,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:07,550 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-10-11 13:37:07,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-10-11 13:37:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:37:07,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:07,553 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:07,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:37:07,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 13:37:07,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:07,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1023877832, now seen corresponding path program 1 times [2024-10-11 13:37:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:07,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388884826] [2024-10-11 13:37:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:07,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:07,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:07,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 13:37:07,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:37:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:08,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:37:08,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:08,952 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-10-11 13:37:09,008 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-10-11 13:37:09,076 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 21 treesize of output 13 [2024-10-11 13:37:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 217 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-11 13:37:09,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:37:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:09,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388884826] [2024-10-11 13:37:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388884826] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:37:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:37:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2024-10-11 13:37:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669629133] [2024-10-11 13:37:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:37:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:09,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:37:09,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:37:09,434 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:10,384 INFO L93 Difference]: Finished difference Result 364 states and 523 transitions. [2024-10-11 13:37:10,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:37:10,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-11 13:37:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:10,387 INFO L225 Difference]: With dead ends: 364 [2024-10-11 13:37:10,387 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 13:37:10,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:37:10,393 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 191 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:10,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1203 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:37:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 13:37:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 189. [2024-10-11 13:37:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 157 states have (on average 1.375796178343949) internal successors, (216), 158 states have internal predecessors, (216), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:37:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2024-10-11 13:37:10,427 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 130 [2024-10-11 13:37:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:10,428 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2024-10-11 13:37:10,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2024-10-11 13:37:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:37:10,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:10,435 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:10,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:37:10,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 13:37:10,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:10,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:10,637 INFO L85 PathProgramCache]: Analyzing trace with hash -715430797, now seen corresponding path program 1 times [2024-10-11 13:37:10,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:10,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469462771] [2024-10-11 13:37:10,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:10,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:10,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:10,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 13:37:10,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:37:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:11,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:37:11,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:11,478 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-10-11 13:37:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:37:11,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:37:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:11,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:11,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469462771] [2024-10-11 13:37:11,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469462771] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:37:11,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:37:11,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-11 13:37:11,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140303316] [2024-10-11 13:37:11,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:11,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:11,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:11,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:11,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:37:11,723 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:11,871 INFO L93 Difference]: Finished difference Result 417 states and 602 transitions. [2024-10-11 13:37:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:37:11,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-11 13:37:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:11,875 INFO L225 Difference]: With dead ends: 417 [2024-10-11 13:37:11,875 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 13:37:11,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:37:11,877 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 132 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:11,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 540 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:37:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 13:37:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 190. [2024-10-11 13:37:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 158 states have (on average 1.3670886075949367) internal successors, (216), 159 states have internal predecessors, (216), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:37:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 274 transitions. [2024-10-11 13:37:11,892 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 274 transitions. Word has length 131 [2024-10-11 13:37:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:11,893 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 274 transitions. [2024-10-11 13:37:11,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 274 transitions. [2024-10-11 13:37:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:37:11,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:11,895 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:11,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:37:12,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 13:37:12,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:12,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1499063075, now seen corresponding path program 1 times [2024-10-11 13:37:12,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:12,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514977889] [2024-10-11 13:37:12,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:12,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:12,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:12,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 13:37:12,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Waiting until timeout for monitored process [2024-10-11 13:37:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:12,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:37:12,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:12,543 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-10-11 13:37:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:12,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:12,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:12,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514977889] [2024-10-11 13:37:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514977889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:12,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:12,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:37:12,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227002145] [2024-10-11 13:37:12,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:12,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:37:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:37:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:37:12,606 INFO L87 Difference]: Start difference. First operand 190 states and 274 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:12,965 INFO L93 Difference]: Finished difference Result 526 states and 752 transitions. [2024-10-11 13:37:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:37:12,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-11 13:37:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:12,971 INFO L225 Difference]: With dead ends: 526 [2024-10-11 13:37:12,971 INFO L226 Difference]: Without dead ends: 337 [2024-10-11 13:37:12,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:37:12,973 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 90 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:12,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 834 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:37:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-11 13:37:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 220. [2024-10-11 13:37:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 188 states have (on average 1.377659574468085) internal successors, (259), 189 states have internal predecessors, (259), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:37:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 317 transitions. [2024-10-11 13:37:12,989 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 317 transitions. Word has length 132 [2024-10-11 13:37:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:12,989 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 317 transitions. [2024-10-11 13:37:12,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 317 transitions. [2024-10-11 13:37:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:37:12,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:12,992 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:13,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Ended with exit code 0 [2024-10-11 13:37:13,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 13:37:13,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:13,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1504230652, now seen corresponding path program 1 times [2024-10-11 13:37:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:13,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982562575] [2024-10-11 13:37:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:13,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:13,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:13,197 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 13:37:13,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Waiting until timeout for monitored process [2024-10-11 13:37:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:13,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:37:13,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:37:14,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:37:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:14,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982562575] [2024-10-11 13:37:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982562575] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:37:14,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:37:14,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-11 13:37:14,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607459125] [2024-10-11 13:37:14,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:14,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:14,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:37:14,149 INFO L87 Difference]: Start difference. First operand 220 states and 317 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:14,286 INFO L93 Difference]: Finished difference Result 468 states and 671 transitions. [2024-10-11 13:37:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:37:14,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-11 13:37:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:14,291 INFO L225 Difference]: With dead ends: 468 [2024-10-11 13:37:14,291 INFO L226 Difference]: Without dead ends: 249 [2024-10-11 13:37:14,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:37:14,293 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 86 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:14,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 433 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:37:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-11 13:37:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 220. [2024-10-11 13:37:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 188 states have (on average 1.3670212765957446) internal successors, (257), 189 states have internal predecessors, (257), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 13:37:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 315 transitions. [2024-10-11 13:37:14,311 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 315 transitions. Word has length 132 [2024-10-11 13:37:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:14,313 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 315 transitions. [2024-10-11 13:37:14,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 315 transitions. [2024-10-11 13:37:14,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:37:14,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:14,315 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:14,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Forceful destruction successful, exit code 0 [2024-10-11 13:37:14,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-11 13:37:14,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:14,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:14,517 INFO L85 PathProgramCache]: Analyzing trace with hash 408018346, now seen corresponding path program 1 times [2024-10-11 13:37:14,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:14,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262901831] [2024-10-11 13:37:14,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:14,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:14,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:14,519 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-11 13:37:14,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (8)] Waiting until timeout for monitored process [2024-10-11 13:37:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:15,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 13:37:15,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:15,104 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 17 treesize of output 13 [2024-10-11 13:37:15,113 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 13 treesize of output 9 [2024-10-11 13:37:15,183 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 25 treesize of output 21 [2024-10-11 13:37:15,195 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 21 treesize of output 17 [2024-10-11 13:37:15,245 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 17 treesize of output 9 [2024-10-11 13:37:16,241 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 49 treesize of output 37 [2024-10-11 13:37:16,248 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 40 [2024-10-11 13:37:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:16,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:16,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:16,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262901831] [2024-10-11 13:37:16,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262901831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:16,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:16,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:37:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214100647] [2024-10-11 13:37:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:16,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:37:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:37:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:37:16,732 INFO L87 Difference]: Start difference. First operand 220 states and 315 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:22,383 INFO L93 Difference]: Finished difference Result 701 states and 977 transitions. [2024-10-11 13:37:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:37:22,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 13:37:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:22,392 INFO L225 Difference]: With dead ends: 701 [2024-10-11 13:37:22,392 INFO L226 Difference]: Without dead ends: 482 [2024-10-11 13:37:22,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:37:22,394 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 285 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:22,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1377 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 13:37:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-11 13:37:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 306. [2024-10-11 13:37:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 265 states have internal predecessors, (353), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 13:37:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 431 transitions. [2024-10-11 13:37:22,421 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 431 transitions. Word has length 133 [2024-10-11 13:37:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:22,422 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 431 transitions. [2024-10-11 13:37:22,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 431 transitions. [2024-10-11 13:37:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:37:22,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:22,424 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:22,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (8)] Ended with exit code 0 [2024-10-11 13:37:22,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-11 13:37:22,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash -603098904, now seen corresponding path program 1 times [2024-10-11 13:37:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838718025] [2024-10-11 13:37:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:22,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:22,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:22,627 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 13:37:22,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Waiting until timeout for monitored process [2024-10-11 13:37:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:23,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:37:23,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:23,143 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 34 treesize of output 22 [2024-10-11 13:37:23,148 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 22 treesize of output 14 [2024-10-11 13:37:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:23,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:23,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:23,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838718025] [2024-10-11 13:37:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838718025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:23,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:23,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:37:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225134660] [2024-10-11 13:37:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:23,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:37:23,199 INFO L87 Difference]: Start difference. First operand 306 states and 431 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:23,714 INFO L93 Difference]: Finished difference Result 605 states and 849 transitions. [2024-10-11 13:37:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:37:23,715 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 13:37:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:23,718 INFO L225 Difference]: With dead ends: 605 [2024-10-11 13:37:23,718 INFO L226 Difference]: Without dead ends: 310 [2024-10-11 13:37:23,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:37:23,720 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 69 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:23,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 714 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:37:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-11 13:37:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 270. [2024-10-11 13:37:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 226 states have (on average 1.331858407079646) internal successors, (301), 229 states have internal predecessors, (301), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 13:37:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2024-10-11 13:37:23,753 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 379 transitions. Word has length 133 [2024-10-11 13:37:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:23,753 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 379 transitions. [2024-10-11 13:37:23,754 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 379 transitions. [2024-10-11 13:37:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:37:23,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:23,756 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:23,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Forceful destruction successful, exit code 0 [2024-10-11 13:37:23,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 13:37:23,957 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:23,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2057422319, now seen corresponding path program 1 times [2024-10-11 13:37:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:23,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266070297] [2024-10-11 13:37:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:23,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:23,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:23,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 13:37:23,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (10)] Waiting until timeout for monitored process [2024-10-11 13:37:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:24,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:37:24,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:24,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:24,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:24,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266070297] [2024-10-11 13:37:24,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266070297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:24,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:24,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:37:24,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580059412] [2024-10-11 13:37:24,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:24,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:24,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:24,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:24,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:37:24,413 INFO L87 Difference]: Start difference. First operand 270 states and 379 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:24,538 INFO L93 Difference]: Finished difference Result 538 states and 754 transitions. [2024-10-11 13:37:24,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:37:24,538 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 13:37:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:24,540 INFO L225 Difference]: With dead ends: 538 [2024-10-11 13:37:24,540 INFO L226 Difference]: Without dead ends: 279 [2024-10-11 13:37:24,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:37:24,542 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:24,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:37:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-11 13:37:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2024-10-11 13:37:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 231 states have (on average 1.3246753246753247) internal successors, (306), 234 states have internal predecessors, (306), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 13:37:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 384 transitions. [2024-10-11 13:37:24,558 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 384 transitions. Word has length 133 [2024-10-11 13:37:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:24,559 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 384 transitions. [2024-10-11 13:37:24,559 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 384 transitions. [2024-10-11 13:37:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:37:24,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:24,560 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:24,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (10)] Ended with exit code 0 [2024-10-11 13:37:24,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 13:37:24,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:24,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash -428122449, now seen corresponding path program 1 times [2024-10-11 13:37:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121889824] [2024-10-11 13:37:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:24,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:24,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:24,768 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-11 13:37:24,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (11)] Waiting until timeout for monitored process [2024-10-11 13:37:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:25,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:37:25,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:25,192 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-10-11 13:37:25,214 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 31 treesize of output 23 [2024-10-11 13:37:25,220 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 13 treesize of output 9 [2024-10-11 13:37:25,259 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 17 treesize of output 9 [2024-10-11 13:37:25,265 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 18 treesize of output 10 [2024-10-11 13:37:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:25,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:25,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:25,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121889824] [2024-10-11 13:37:25,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121889824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:25,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:25,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:37:25,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525342341] [2024-10-11 13:37:25,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:25,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:25,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:25,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:25,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:37:25,290 INFO L87 Difference]: Start difference. First operand 275 states and 384 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:26,417 INFO L93 Difference]: Finished difference Result 884 states and 1217 transitions. [2024-10-11 13:37:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:37:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-11 13:37:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:26,421 INFO L225 Difference]: With dead ends: 884 [2024-10-11 13:37:26,421 INFO L226 Difference]: Without dead ends: 620 [2024-10-11 13:37:26,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:37:26,422 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 330 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:26,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 882 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:37:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-10-11 13:37:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 606. [2024-10-11 13:37:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 496 states have (on average 1.284274193548387) internal successors, (637), 503 states have internal predecessors, (637), 97 states have call successors, (97), 12 states have call predecessors, (97), 12 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 13:37:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 831 transitions. [2024-10-11 13:37:26,472 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 831 transitions. Word has length 134 [2024-10-11 13:37:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:26,472 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 831 transitions. [2024-10-11 13:37:26,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 831 transitions. [2024-10-11 13:37:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:37:26,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:26,474 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:26,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (11)] Forceful destruction successful, exit code 0 [2024-10-11 13:37:26,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-10-11 13:37:26,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:26,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash -942708217, now seen corresponding path program 1 times [2024-10-11 13:37:26,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:26,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151762444] [2024-10-11 13:37:26,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:26,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:26,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:26,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-10-11 13:37:26,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (12)] Waiting until timeout for monitored process [2024-10-11 13:37:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:27,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:37:27,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:27,217 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 35 treesize of output 23 [2024-10-11 13:37:27,223 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 23 treesize of output 15 [2024-10-11 13:37:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:27,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:27,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151762444] [2024-10-11 13:37:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151762444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:27,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:27,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:37:27,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390372023] [2024-10-11 13:37:27,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:27,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:27,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:27,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:27,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:37:27,309 INFO L87 Difference]: Start difference. First operand 606 states and 831 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:27,909 INFO L93 Difference]: Finished difference Result 1202 states and 1637 transitions. [2024-10-11 13:37:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:37:27,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-11 13:37:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:27,914 INFO L225 Difference]: With dead ends: 1202 [2024-10-11 13:37:27,914 INFO L226 Difference]: Without dead ends: 607 [2024-10-11 13:37:27,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:37:27,916 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 59 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:27,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 554 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:37:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-11 13:37:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 424. [2024-10-11 13:37:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 357 states have (on average 1.2997198879551821) internal successors, (464), 359 states have internal predecessors, (464), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:37:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 580 transitions. [2024-10-11 13:37:27,954 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 580 transitions. Word has length 135 [2024-10-11 13:37:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:27,954 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 580 transitions. [2024-10-11 13:37:27,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 580 transitions. [2024-10-11 13:37:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:37:27,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:27,957 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:27,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (12)] Forceful destruction successful, exit code 0 [2024-10-11 13:37:28,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-10-11 13:37:28,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:28,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1673912260, now seen corresponding path program 1 times [2024-10-11 13:37:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:28,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133442758] [2024-10-11 13:37:28,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:28,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:28,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:28,160 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-10-11 13:37:28,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (13)] Waiting until timeout for monitored process [2024-10-11 13:37:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:28,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:37:28,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:28,915 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-10-11 13:37:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:37:29,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:37:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:29,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:29,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133442758] [2024-10-11 13:37:29,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133442758] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:37:29,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:37:29,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2024-10-11 13:37:29,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766655347] [2024-10-11 13:37:29,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:29,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:37:29,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:29,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:37:29,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:37:29,145 INFO L87 Difference]: Start difference. First operand 424 states and 580 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:29,507 INFO L93 Difference]: Finished difference Result 988 states and 1344 transitions. [2024-10-11 13:37:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:37:29,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-11 13:37:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:29,514 INFO L225 Difference]: With dead ends: 988 [2024-10-11 13:37:29,514 INFO L226 Difference]: Without dead ends: 565 [2024-10-11 13:37:29,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:37:29,516 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 83 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:29,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1178 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:37:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-11 13:37:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 561. [2024-10-11 13:37:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 470 states have (on average 1.2851063829787235) internal successors, (604), 474 states have internal predecessors, (604), 78 states have call successors, (78), 12 states have call predecessors, (78), 12 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 13:37:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 760 transitions. [2024-10-11 13:37:29,565 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 760 transitions. Word has length 135 [2024-10-11 13:37:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:29,565 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 760 transitions. [2024-10-11 13:37:29,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 760 transitions. [2024-10-11 13:37:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:37:29,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:29,567 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:29,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (13)] Forceful destruction successful, exit code 0 [2024-10-11 13:37:29,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-10-11 13:37:29,767 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:29,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1558220474, now seen corresponding path program 1 times [2024-10-11 13:37:29,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:29,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71200295] [2024-10-11 13:37:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:29,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:29,770 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-10-11 13:37:29,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (14)] Waiting until timeout for monitored process [2024-10-11 13:37:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:30,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:37:30,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:37:30,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:37:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:37:30,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:30,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71200295] [2024-10-11 13:37:30,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71200295] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:37:30,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:37:30,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-11 13:37:30,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033235708] [2024-10-11 13:37:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:30,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:30,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:30,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:30,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:37:30,597 INFO L87 Difference]: Start difference. First operand 561 states and 760 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:30,749 INFO L93 Difference]: Finished difference Result 1122 states and 1519 transitions. [2024-10-11 13:37:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:37:30,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-10-11 13:37:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:30,753 INFO L225 Difference]: With dead ends: 1122 [2024-10-11 13:37:30,754 INFO L226 Difference]: Without dead ends: 562 [2024-10-11 13:37:30,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:37:30,756 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 44 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:30,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 577 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:37:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-10-11 13:37:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 547. [2024-10-11 13:37:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 456 states have (on average 1.280701754385965) internal successors, (584), 460 states have internal predecessors, (584), 78 states have call successors, (78), 12 states have call predecessors, (78), 12 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 13:37:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 740 transitions. [2024-10-11 13:37:30,798 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 740 transitions. Word has length 136 [2024-10-11 13:37:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:30,799 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 740 transitions. [2024-10-11 13:37:30,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:37:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 740 transitions. [2024-10-11 13:37:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 13:37:30,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:30,800 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:30,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (14)] Ended with exit code 0 [2024-10-11 13:37:31,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-10-11 13:37:31,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:31,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1645599703, now seen corresponding path program 1 times [2024-10-11 13:37:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:31,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751563661] [2024-10-11 13:37:31,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:31,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:31,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:31,003 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-10-11 13:37:31,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (15)] Waiting until timeout for monitored process [2024-10-11 13:37:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:31,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:37:31,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:31,723 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 41 [2024-10-11 13:37:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:37:31,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:31,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:31,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751563661] [2024-10-11 13:37:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751563661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:31,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:31,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:37:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873012803] [2024-10-11 13:37:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:31,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:37:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:31,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:37:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:37:31,748 INFO L87 Difference]: Start difference. First operand 547 states and 740 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:37:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:32,679 INFO L93 Difference]: Finished difference Result 1095 states and 1481 transitions. [2024-10-11 13:37:32,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:37:32,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 137 [2024-10-11 13:37:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:32,683 INFO L225 Difference]: With dead ends: 1095 [2024-10-11 13:37:32,683 INFO L226 Difference]: Without dead ends: 549 [2024-10-11 13:37:32,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:37:32,685 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 95 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:32,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 474 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:37:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-11 13:37:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 547. [2024-10-11 13:37:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 456 states have (on average 1.2763157894736843) internal successors, (582), 460 states have internal predecessors, (582), 78 states have call successors, (78), 12 states have call predecessors, (78), 12 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 13:37:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 738 transitions. [2024-10-11 13:37:32,735 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 738 transitions. Word has length 137 [2024-10-11 13:37:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:32,735 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 738 transitions. [2024-10-11 13:37:32,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:37:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 738 transitions. [2024-10-11 13:37:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:37:32,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:32,737 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:32,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (15)] Ended with exit code 0 [2024-10-11 13:37:32,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-10-11 13:37:32,938 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:32,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash 17082797, now seen corresponding path program 1 times [2024-10-11 13:37:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:32,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020372006] [2024-10-11 13:37:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:32,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:32,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:32,943 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-10-11 13:37:32,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (16)] Waiting until timeout for monitored process [2024-10-11 13:37:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:33,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:37:33,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:37:33,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:33,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:33,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020372006] [2024-10-11 13:37:33,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020372006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:33,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:33,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:37:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124262970] [2024-10-11 13:37:33,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:33,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:37:33,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:33,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:37:33,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:37:33,379 INFO L87 Difference]: Start difference. First operand 547 states and 738 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:37:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:33,644 INFO L93 Difference]: Finished difference Result 1121 states and 1505 transitions. [2024-10-11 13:37:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:37:33,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-10-11 13:37:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:33,648 INFO L225 Difference]: With dead ends: 1121 [2024-10-11 13:37:33,648 INFO L226 Difference]: Without dead ends: 571 [2024-10-11 13:37:33,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:37:33,651 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:33,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 605 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:37:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-11 13:37:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 547. [2024-10-11 13:37:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 456 states have (on average 1.2719298245614035) internal successors, (580), 460 states have internal predecessors, (580), 78 states have call successors, (78), 12 states have call predecessors, (78), 12 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 13:37:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 736 transitions. [2024-10-11 13:37:33,702 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 736 transitions. Word has length 139 [2024-10-11 13:37:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:33,702 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 736 transitions. [2024-10-11 13:37:33,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:37:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 736 transitions. [2024-10-11 13:37:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:37:33,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:33,705 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:33,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (16)] Ended with exit code 0 [2024-10-11 13:37:33,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/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-10-11 13:37:33,906 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:33,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:33,906 INFO L85 PathProgramCache]: Analyzing trace with hash -257676817, now seen corresponding path program 1 times [2024-10-11 13:37:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:33,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074550064] [2024-10-11 13:37:33,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:33,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:33,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:33,910 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/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-10-11 13:37:33,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (17)] Waiting until timeout for monitored process [2024-10-11 13:37:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:34,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 13:37:34,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:35,598 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 15 treesize of output 1 [2024-10-11 13:37:35,790 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 125 treesize of output 89 [2024-10-11 13:37:35,794 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 135 treesize of output 75 [2024-10-11 13:37:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:37:35,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:37:36,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:36,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074550064] [2024-10-11 13:37:36,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074550064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:37:36,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [272455667] [2024-10-11 13:37:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:36,157 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:37:36,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:37:36,159 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:37:36,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-10-11 13:37:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:44,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 13:37:44,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:46,732 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 15 treesize of output 1 [2024-10-11 13:37:47,842 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 15 treesize of output 1 [2024-10-11 13:37:48,226 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 125 treesize of output 89 [2024-10-11 13:37:48,230 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 135 treesize of output 75 [2024-10-11 13:37:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:37:48,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:37:48,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [272455667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:37:48,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:37:48,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-10-11 13:37:48,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495036061] [2024-10-11 13:37:48,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:37:48,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 13:37:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:48,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 13:37:48,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:37:48,454 INFO L87 Difference]: Start difference. First operand 547 states and 736 transitions. Second operand has 26 states, 24 states have (on average 4.875) internal successors, (117), 23 states have internal predecessors, (117), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-11 13:37:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:52,698 INFO L93 Difference]: Finished difference Result 1192 states and 1591 transitions. [2024-10-11 13:37:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 13:37:52,699 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.875) internal successors, (117), 23 states have internal predecessors, (117), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 139 [2024-10-11 13:37:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:52,704 INFO L225 Difference]: With dead ends: 1192 [2024-10-11 13:37:52,704 INFO L226 Difference]: Without dead ends: 1190 [2024-10-11 13:37:52,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=420, Invalid=1650, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 13:37:52,706 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 510 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:52,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1890 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 13:37:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-10-11 13:37:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1107. [2024-10-11 13:37:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 924 states have (on average 1.2662337662337662) internal successors, (1170), 934 states have internal predecessors, (1170), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 146 states have call predecessors, (156), 156 states have call successors, (156) [2024-10-11 13:37:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1482 transitions. [2024-10-11 13:37:52,817 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1482 transitions. Word has length 139 [2024-10-11 13:37:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:52,817 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1482 transitions. [2024-10-11 13:37:52,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.875) internal successors, (117), 23 states have internal predecessors, (117), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-11 13:37:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1482 transitions. [2024-10-11 13:37:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:37:52,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:52,819 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:37:52,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-10-11 13:37:53,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (17)] Ended with exit code 0 [2024-10-11 13:37:53,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,17 /storage/repos/ultimate-clean/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-10-11 13:37:53,220 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:53,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash -257617235, now seen corresponding path program 1 times [2024-10-11 13:37:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585649382] [2024-10-11 13:37:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:37:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:53,223 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/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-10-11 13:37:53,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (19)] Waiting until timeout for monitored process