./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-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:47:39,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:47:39,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:47:39,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:47:39,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:47:39,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:47:39,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:47:39,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:47:39,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:47:39,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:47:39,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:47:39,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:47:39,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:47:39,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:47:39,757 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:47:39,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:47:39,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:47:39,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:47:39,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:47:39,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:47:39,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:47:39,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:47:39,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:47:39,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:47:39,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:47:39,764 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:47:39,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:47:39,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:47:39,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:47:39,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:47:39,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:47:39,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:47:39,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:47:39,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:47:39,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:47:39,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:47:39,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:47:39,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:47:39,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:47:39,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:47:39,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:47:39,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:47:39,769 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 [2024-11-20 08:47:39,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:47:39,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:47:40,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:47:40,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:47:40,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:47:40,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2024-11-20 08:47:41,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:47:41,597 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:47:41,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2024-11-20 08:47:41,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381d0b643/aee8a8ff6d2e44cb96b159dab6a7d34a/FLAG28059f363 [2024-11-20 08:47:41,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381d0b643/aee8a8ff6d2e44cb96b159dab6a7d34a [2024-11-20 08:47:41,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:47:41,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:47:41,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:47:41,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:47:41,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:47:41,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:47:41" (1/1) ... [2024-11-20 08:47:41,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638d4414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:41, skipping insertion in model container [2024-11-20 08:47:41,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:47:41" (1/1) ... [2024-11-20 08:47:41,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:47:42,122 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-11-20 08:47:42,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:47:42,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:47:42,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-11-20 08:47:42,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:47:42,226 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:47:42,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42 WrapperNode [2024-11-20 08:47:42,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:47:42,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:47:42,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:47:42,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:47:42,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,285 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 528 [2024-11-20 08:47:42,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:47:42,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:47:42,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:47:42,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:47:42,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,323 INFO L175 MemorySlicer]: Split 133 memory accesses to 16 slices as follows [2, 3, 12, 12, 6, 5, 10, 7, 10, 10, 12, 17, 6, 10, 5, 6]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-11-20 08:47:42,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:47:42,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:47:42,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:47:42,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:47:42,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (1/1) ... [2024-11-20 08:47:42,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:47:42,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:47:42,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:47:42,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:47:42,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:47:42,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:47:42,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:47:42,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:47:42,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:47:42,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-20 08:47:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-20 08:47:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-20 08:47:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-20 08:47:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-20 08:47:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-20 08:47:42,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-20 08:47:42,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-20 08:47:42,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-20 08:47:42,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-20 08:47:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-20 08:47:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-20 08:47:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:47:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:47:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:47:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:47:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:47:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 08:47:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-20 08:47:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-20 08:47:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-20 08:47:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-20 08:47:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-20 08:47:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-20 08:47:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-20 08:47:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-20 08:47:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-20 08:47:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-20 08:47:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-20 08:47:42,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-20 08:47:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-20 08:47:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-20 08:47:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-20 08:47:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-20 08:47:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:47:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:47:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:47:42,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:47:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:47:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-20 08:47:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-20 08:47:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-20 08:47:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-20 08:47:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-20 08:47:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-20 08:47:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-20 08:47:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-20 08:47:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-20 08:47:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-20 08:47:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-20 08:47:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:47:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:47:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:47:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:47:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-20 08:47:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-20 08:47:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-20 08:47:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-20 08:47:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-20 08:47:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-20 08:47:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-20 08:47:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-20 08:47:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-20 08:47:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-20 08:47:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-20 08:47:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-20 08:47:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:47:42,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:47:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-20 08:47:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:47:42,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:47:42,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:47:42,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:47:43,183 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-20 08:47:43,184 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:47:43,202 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:47:43,203 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:47:43,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:47:43 BoogieIcfgContainer [2024-11-20 08:47:43,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:47:43,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:47:43,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:47:43,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:47:43,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:47:41" (1/3) ... [2024-11-20 08:47:43,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c3b156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:47:43, skipping insertion in model container [2024-11-20 08:47:43,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:47:42" (2/3) ... [2024-11-20 08:47:43,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c3b156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:47:43, skipping insertion in model container [2024-11-20 08:47:43,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:47:43" (3/3) ... [2024-11-20 08:47:43,211 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2024-11-20 08:47:43,224 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:47:43,225 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:47:43,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:47:43,277 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;@ab0278c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:47:43,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:47:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:47:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:47:43,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:43,292 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:43,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:43,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1513522922, now seen corresponding path program 1 times [2024-11-20 08:47:43,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263841647] [2024-11-20 08:47:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:43,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:43,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:43,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263841647] [2024-11-20 08:47:43,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263841647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:43,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:43,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:47:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196650721] [2024-11-20 08:47:43,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:43,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:47:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:43,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:47:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:47:43,669 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:47:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:43,700 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2024-11-20 08:47:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:47:43,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-20 08:47:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:43,712 INFO L225 Difference]: With dead ends: 217 [2024-11-20 08:47:43,712 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 08:47:43,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:47:43,719 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:43,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:47:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 08:47:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-20 08:47:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:47:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-11-20 08:47:43,755 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2024-11-20 08:47:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:43,755 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-11-20 08:47:43,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:47:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-11-20 08:47:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:47:43,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:43,760 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:43,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:47:43,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:43,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -202382474, now seen corresponding path program 1 times [2024-11-20 08:47:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:43,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588242712] [2024-11-20 08:47:43,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:43,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:44,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:44,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588242712] [2024-11-20 08:47:44,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588242712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:44,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:44,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:47:44,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403885655] [2024-11-20 08:47:44,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:44,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:47:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:44,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:47:44,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:47:44,393 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:44,422 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2024-11-20 08:47:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:47:44,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-20 08:47:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:44,425 INFO L225 Difference]: With dead ends: 213 [2024-11-20 08:47:44,427 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 08:47:44,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:47:44,428 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 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-11-20 08:47:44,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:47:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 08:47:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-20 08:47:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:47:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-20 08:47:44,438 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2024-11-20 08:47:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:44,439 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-20 08:47:44,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-20 08:47:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:47:44,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:44,445 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:44,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:47:44,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:44,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:44,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1223450828, now seen corresponding path program 1 times [2024-11-20 08:47:44,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:44,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552292562] [2024-11-20 08:47:44,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:44,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552292562] [2024-11-20 08:47:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552292562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:45,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:45,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:47:45,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439996845] [2024-11-20 08:47:45,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:45,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:47:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:45,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:47:45,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:47:45,478 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 08:47:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:45,743 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2024-11-20 08:47:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:47:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 140 [2024-11-20 08:47:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:45,748 INFO L225 Difference]: With dead ends: 219 [2024-11-20 08:47:45,748 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 08:47:45,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:47:45,750 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 216 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:45,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 546 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:47:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 08:47:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-20 08:47:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:47:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-20 08:47:45,772 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 140 [2024-11-20 08:47:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:45,772 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-20 08:47:45,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 08:47:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-20 08:47:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:47:45,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:45,777 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:45,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:47:45,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:45,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:45,777 INFO L85 PathProgramCache]: Analyzing trace with hash -522386250, now seen corresponding path program 1 times [2024-11-20 08:47:45,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:45,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062840493] [2024-11-20 08:47:45,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:46,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062840493] [2024-11-20 08:47:46,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062840493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:46,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:46,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:47:46,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368344111] [2024-11-20 08:47:46,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:46,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:47:46,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:46,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:47:46,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:47:46,639 INFO L87 Difference]: Start difference. First operand 114 states and 159 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:46,816 INFO L93 Difference]: Finished difference Result 336 states and 470 transitions. [2024-11-20 08:47:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:47:46,819 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-20 08:47:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:46,821 INFO L225 Difference]: With dead ends: 336 [2024-11-20 08:47:46,823 INFO L226 Difference]: Without dead ends: 225 [2024-11-20 08:47:46,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:47:46,824 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 96 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:46,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 597 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:47:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-20 08:47:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2024-11-20 08:47:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 178 states have (on average 1.3258426966292134) internal successors, (236), 178 states have internal predecessors, (236), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:47:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 308 transitions. [2024-11-20 08:47:46,857 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 308 transitions. Word has length 140 [2024-11-20 08:47:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:46,857 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 308 transitions. [2024-11-20 08:47:46,857 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 308 transitions. [2024-11-20 08:47:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 08:47:46,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:46,858 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:46,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:47:46,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:46,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:46,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1166428163, now seen corresponding path program 1 times [2024-11-20 08:47:46,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723802612] [2024-11-20 08:47:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:46,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:47,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:47,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723802612] [2024-11-20 08:47:47,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723802612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:47,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:47,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:47:47,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252087641] [2024-11-20 08:47:47,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:47,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:47:47,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:47,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:47:47,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:47:47,691 INFO L87 Difference]: Start difference. First operand 219 states and 308 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:47,922 INFO L93 Difference]: Finished difference Result 330 states and 463 transitions. [2024-11-20 08:47:47,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:47:47,924 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-11-20 08:47:47,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:47,925 INFO L225 Difference]: With dead ends: 330 [2024-11-20 08:47:47,925 INFO L226 Difference]: Without dead ends: 219 [2024-11-20 08:47:47,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:47:47,926 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 144 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:47,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 539 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:47:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-20 08:47:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 112. [2024-11-20 08:47:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:47:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2024-11-20 08:47:47,945 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 142 [2024-11-20 08:47:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:47,946 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2024-11-20 08:47:47,946 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2024-11-20 08:47:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:47:47,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:47,947 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:47,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:47:47,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:47,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash -980903822, now seen corresponding path program 1 times [2024-11-20 08:47:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:47,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046719726] [2024-11-20 08:47:47,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:47,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046719726] [2024-11-20 08:47:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046719726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:48,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:47:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109073061] [2024-11-20 08:47:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:48,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:47:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:48,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:47:48,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:47:48,185 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:48,211 INFO L93 Difference]: Finished difference Result 221 states and 307 transitions. [2024-11-20 08:47:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:47:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:47:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:48,213 INFO L225 Difference]: With dead ends: 221 [2024-11-20 08:47:48,213 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 08:47:48,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:47:48,214 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:48,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:47:48,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 08:47:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-20 08:47:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:47:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2024-11-20 08:47:48,222 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 145 [2024-11-20 08:47:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:48,222 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2024-11-20 08:47:48,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2024-11-20 08:47:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:47:48,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:48,223 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:48,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:47:48,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:48,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1567709836, now seen corresponding path program 1 times [2024-11-20 08:47:48,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:48,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052799432] [2024-11-20 08:47:48,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:48,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:48,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:48,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052799432] [2024-11-20 08:47:48,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052799432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:48,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:48,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:47:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205096775] [2024-11-20 08:47:48,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:48,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:47:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:48,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:47:48,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:47:48,993 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 08:47:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:49,305 INFO L93 Difference]: Finished difference Result 299 states and 409 transitions. [2024-11-20 08:47:49,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:47:49,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 145 [2024-11-20 08:47:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:49,307 INFO L225 Difference]: With dead ends: 299 [2024-11-20 08:47:49,307 INFO L226 Difference]: Without dead ends: 190 [2024-11-20 08:47:49,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:47:49,308 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 221 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:49,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1148 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:47:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-20 08:47:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-11-20 08:47:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 155 states have internal predecessors, (199), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 08:47:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 255 transitions. [2024-11-20 08:47:49,325 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 255 transitions. Word has length 145 [2024-11-20 08:47:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:49,325 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 255 transitions. [2024-11-20 08:47:49,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 08:47:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 255 transitions. [2024-11-20 08:47:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 08:47:49,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:49,327 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:49,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:47:49,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:49,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:49,327 INFO L85 PathProgramCache]: Analyzing trace with hash -632074444, now seen corresponding path program 1 times [2024-11-20 08:47:49,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:49,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903568337] [2024-11-20 08:47:49,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:49,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903568337] [2024-11-20 08:47:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903568337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 08:47:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283568472] [2024-11-20 08:47:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:50,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:47:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:50,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:47:50,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:47:50,251 INFO L87 Difference]: Start difference. First operand 187 states and 255 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 08:47:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:51,043 INFO L93 Difference]: Finished difference Result 607 states and 829 transitions. [2024-11-20 08:47:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:47:51,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2024-11-20 08:47:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:51,047 INFO L225 Difference]: With dead ends: 607 [2024-11-20 08:47:51,048 INFO L226 Difference]: Without dead ends: 423 [2024-11-20 08:47:51,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:47:51,049 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 233 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:51,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1335 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:47:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-20 08:47:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 416. [2024-11-20 08:47:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 348 states have (on average 1.3074712643678161) internal successors, (455), 351 states have internal predecessors, (455), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 08:47:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 571 transitions. [2024-11-20 08:47:51,088 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 571 transitions. Word has length 146 [2024-11-20 08:47:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:51,088 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 571 transitions. [2024-11-20 08:47:51,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 08:47:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 571 transitions. [2024-11-20 08:47:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 08:47:51,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:51,090 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:51,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:47:51,090 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:51,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash 68990134, now seen corresponding path program 1 times [2024-11-20 08:47:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:51,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541506633] [2024-11-20 08:47:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:52,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:52,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541506633] [2024-11-20 08:47:52,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541506633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:52,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-20 08:47:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463567315] [2024-11-20 08:47:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:52,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 08:47:52,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:52,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 08:47:52,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:47:52,344 INFO L87 Difference]: Start difference. First operand 416 states and 571 transitions. Second operand has 17 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-20 08:47:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:53,107 INFO L93 Difference]: Finished difference Result 872 states and 1191 transitions. [2024-11-20 08:47:53,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:47:53,108 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 146 [2024-11-20 08:47:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:53,110 INFO L225 Difference]: With dead ends: 872 [2024-11-20 08:47:53,110 INFO L226 Difference]: Without dead ends: 459 [2024-11-20 08:47:53,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2024-11-20 08:47:53,114 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 531 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:53,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1483 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:47:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-20 08:47:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 422. [2024-11-20 08:47:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 354 states have (on average 1.2966101694915255) internal successors, (459), 357 states have internal predecessors, (459), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 08:47:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 575 transitions. [2024-11-20 08:47:53,169 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 575 transitions. Word has length 146 [2024-11-20 08:47:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:53,169 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 575 transitions. [2024-11-20 08:47:53,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-20 08:47:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 575 transitions. [2024-11-20 08:47:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 08:47:53,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:53,172 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:53,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 08:47:53,173 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:53,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1449722894, now seen corresponding path program 1 times [2024-11-20 08:47:53,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:53,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038098392] [2024-11-20 08:47:53,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:53,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:53,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:53,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038098392] [2024-11-20 08:47:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038098392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:53,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:53,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 08:47:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384649365] [2024-11-20 08:47:53,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:53,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 08:47:53,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:53,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 08:47:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:47:53,981 INFO L87 Difference]: Start difference. First operand 422 states and 575 transitions. Second operand has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 08:47:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:54,470 INFO L93 Difference]: Finished difference Result 878 states and 1193 transitions. [2024-11-20 08:47:54,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:47:54,470 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2024-11-20 08:47:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:54,474 INFO L225 Difference]: With dead ends: 878 [2024-11-20 08:47:54,475 INFO L226 Difference]: Without dead ends: 459 [2024-11-20 08:47:54,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:47:54,476 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 338 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:54,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1459 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:47:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-20 08:47:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 422. [2024-11-20 08:47:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 354 states have (on average 1.2909604519774012) internal successors, (457), 357 states have internal predecessors, (457), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 08:47:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 573 transitions. [2024-11-20 08:47:54,513 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 573 transitions. Word has length 146 [2024-11-20 08:47:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:54,516 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 573 transitions. [2024-11-20 08:47:54,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 08:47:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 573 transitions. [2024-11-20 08:47:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 08:47:54,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:54,518 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 08:47:54,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:54,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash -748658316, now seen corresponding path program 1 times [2024-11-20 08:47:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603363365] [2024-11-20 08:47:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:55,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603363365] [2024-11-20 08:47:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603363365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:55,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:55,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 08:47:55,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356576713] [2024-11-20 08:47:55,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:55,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:47:55,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:55,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:47:55,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:47:55,282 INFO L87 Difference]: Start difference. First operand 422 states and 573 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:47:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:55,735 INFO L93 Difference]: Finished difference Result 849 states and 1149 transitions. [2024-11-20 08:47:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:47:55,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-11-20 08:47:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:55,737 INFO L225 Difference]: With dead ends: 849 [2024-11-20 08:47:55,737 INFO L226 Difference]: Without dead ends: 430 [2024-11-20 08:47:55,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:47:55,738 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 276 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:55,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1416 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:47:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-20 08:47:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 422. [2024-11-20 08:47:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 354 states have (on average 1.2881355932203389) internal successors, (456), 357 states have internal predecessors, (456), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 08:47:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 572 transitions. [2024-11-20 08:47:55,774 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 572 transitions. Word has length 146 [2024-11-20 08:47:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:55,774 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 572 transitions. [2024-11-20 08:47:55,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:47:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 572 transitions. [2024-11-20 08:47:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 08:47:55,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:55,776 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:55,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 08:47:55,776 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:55,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1590857722, now seen corresponding path program 1 times [2024-11-20 08:47:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:55,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641498575] [2024-11-20 08:47:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:55,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:55,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641498575] [2024-11-20 08:47:55,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641498575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:55,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:55,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:47:55,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764489638] [2024-11-20 08:47:55,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:55,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:47:55,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:47:55,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:47:55,934 INFO L87 Difference]: Start difference. First operand 422 states and 572 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:55,976 INFO L93 Difference]: Finished difference Result 856 states and 1161 transitions. [2024-11-20 08:47:55,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:47:55,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-20 08:47:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:55,978 INFO L225 Difference]: With dead ends: 856 [2024-11-20 08:47:55,978 INFO L226 Difference]: Without dead ends: 437 [2024-11-20 08:47:55,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-11-20 08:47:55,980 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:55,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:47:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-20 08:47:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-11-20 08:47:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 369 states have (on average 1.2764227642276422) internal successors, (471), 372 states have internal predecessors, (471), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 08:47:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 587 transitions. [2024-11-20 08:47:56,009 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 587 transitions. Word has length 147 [2024-11-20 08:47:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:56,010 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 587 transitions. [2024-11-20 08:47:56,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 587 transitions. [2024-11-20 08:47:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 08:47:56,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:56,011 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:56,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 08:47:56,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:56,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash -529522224, now seen corresponding path program 1 times [2024-11-20 08:47:56,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:56,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451737645] [2024-11-20 08:47:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:56,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:56,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:56,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451737645] [2024-11-20 08:47:56,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451737645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:56,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:56,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:47:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145553996] [2024-11-20 08:47:56,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:56,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:47:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:56,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:47:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:47:56,176 INFO L87 Difference]: Start difference. First operand 437 states and 587 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:56,242 INFO L93 Difference]: Finished difference Result 891 states and 1196 transitions. [2024-11-20 08:47:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:47:56,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-20 08:47:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:56,245 INFO L225 Difference]: With dead ends: 891 [2024-11-20 08:47:56,245 INFO L226 Difference]: Without dead ends: 457 [2024-11-20 08:47:56,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:47:56,246 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:56,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:47:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-20 08:47:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 451. [2024-11-20 08:47:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 383 states have (on average 1.2663185378590078) internal successors, (485), 386 states have internal predecessors, (485), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 08:47:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 601 transitions. [2024-11-20 08:47:56,274 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 601 transitions. Word has length 147 [2024-11-20 08:47:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:56,274 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 601 transitions. [2024-11-20 08:47:56,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:47:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 601 transitions. [2024-11-20 08:47:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 08:47:56,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:56,275 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:56,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 08:47:56,275 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:56,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:56,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1237831365, now seen corresponding path program 1 times [2024-11-20 08:47:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:56,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762324239] [2024-11-20 08:47:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:57,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762324239] [2024-11-20 08:47:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762324239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:57,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:57,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 08:47:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262892208] [2024-11-20 08:47:57,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:57,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 08:47:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:57,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 08:47:57,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:47:57,083 INFO L87 Difference]: Start difference. First operand 451 states and 601 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 08:47:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:57,694 INFO L93 Difference]: Finished difference Result 706 states and 942 transitions. [2024-11-20 08:47:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:47:57,694 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 148 [2024-11-20 08:47:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:57,696 INFO L225 Difference]: With dead ends: 706 [2024-11-20 08:47:57,696 INFO L226 Difference]: Without dead ends: 511 [2024-11-20 08:47:57,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-20 08:47:57,697 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 310 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:57,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1300 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:47:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-20 08:47:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2024-11-20 08:47:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 436 states have (on average 1.2729357798165137) internal successors, (555), 440 states have internal predecessors, (555), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 08:47:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 675 transitions. [2024-11-20 08:47:57,727 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 675 transitions. Word has length 148 [2024-11-20 08:47:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:57,728 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 675 transitions. [2024-11-20 08:47:57,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 08:47:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 675 transitions. [2024-11-20 08:47:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 08:47:57,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:57,729 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:57,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 08:47:57,729 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:57,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash -536766787, now seen corresponding path program 1 times [2024-11-20 08:47:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:57,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509503190] [2024-11-20 08:47:57,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:57,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:58,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:58,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509503190] [2024-11-20 08:47:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509503190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:58,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:58,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:47:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850998056] [2024-11-20 08:47:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:58,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:47:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:47:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:47:58,126 INFO L87 Difference]: Start difference. First operand 507 states and 675 transitions. Second operand has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 08:47:58,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:58,457 INFO L93 Difference]: Finished difference Result 836 states and 1111 transitions. [2024-11-20 08:47:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:47:58,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2024-11-20 08:47:58,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:58,460 INFO L225 Difference]: With dead ends: 836 [2024-11-20 08:47:58,460 INFO L226 Difference]: Without dead ends: 585 [2024-11-20 08:47:58,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:47:58,461 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 404 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:58,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 670 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:47:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-20 08:47:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 513. [2024-11-20 08:47:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 442 states have (on average 1.2647058823529411) internal successors, (559), 446 states have internal predecessors, (559), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 08:47:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 679 transitions. [2024-11-20 08:47:58,494 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 679 transitions. Word has length 148 [2024-11-20 08:47:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:58,494 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 679 transitions. [2024-11-20 08:47:58,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 08:47:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 679 transitions. [2024-11-20 08:47:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 08:47:58,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:58,496 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:58,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 08:47:58,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:58,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2055479815, now seen corresponding path program 1 times [2024-11-20 08:47:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125433163] [2024-11-20 08:47:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:47:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:47:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:47:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:47:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:47:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:47:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:47:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:47:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:47:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:47:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:47:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:47:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:47:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:47:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:47:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:47:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:47:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:47:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:47:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:47:58,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:47:58,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125433163] [2024-11-20 08:47:58,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125433163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:47:58,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:47:58,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:47:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342967975] [2024-11-20 08:47:58,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:47:58,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:47:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:47:58,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:47:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:47:58,955 INFO L87 Difference]: Start difference. First operand 513 states and 679 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 08:47:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:47:59,316 INFO L93 Difference]: Finished difference Result 842 states and 1113 transitions. [2024-11-20 08:47:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:47:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2024-11-20 08:47:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:47:59,322 INFO L225 Difference]: With dead ends: 842 [2024-11-20 08:47:59,323 INFO L226 Difference]: Without dead ends: 585 [2024-11-20 08:47:59,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:47:59,327 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 321 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:47:59,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1020 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:47:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-20 08:47:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 513. [2024-11-20 08:47:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 442 states have (on average 1.260180995475113) internal successors, (557), 446 states have internal predecessors, (557), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 08:47:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 677 transitions. [2024-11-20 08:47:59,361 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 677 transitions. Word has length 148 [2024-11-20 08:47:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:47:59,362 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 677 transitions. [2024-11-20 08:47:59,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 08:47:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 677 transitions. [2024-11-20 08:47:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 08:47:59,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:47:59,364 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:47:59,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 08:47:59,365 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:47:59,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:47:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1354415237, now seen corresponding path program 1 times [2024-11-20 08:47:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:47:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635360379] [2024-11-20 08:47:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:47:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:47:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:48:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:48:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:48:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:48:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:48:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:48:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:48:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:48:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:48:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:48:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:48:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:48:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:48:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:48:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:48:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:48:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:48:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:48:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:48:00,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:48:00,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635360379] [2024-11-20 08:48:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635360379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:48:00,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:48:00,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 08:48:00,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999917808] [2024-11-20 08:48:00,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:48:00,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 08:48:00,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:48:00,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 08:48:00,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:48:00,389 INFO L87 Difference]: Start difference. First operand 513 states and 677 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:48:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:01,136 INFO L93 Difference]: Finished difference Result 774 states and 1019 transitions. [2024-11-20 08:48:01,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:48:01,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2024-11-20 08:48:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:01,139 INFO L225 Difference]: With dead ends: 774 [2024-11-20 08:48:01,139 INFO L226 Difference]: Without dead ends: 517 [2024-11-20 08:48:01,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2024-11-20 08:48:01,141 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 278 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:01,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1450 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:48:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-20 08:48:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 260. [2024-11-20 08:48:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 226 states have internal predecessors, (281), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 08:48:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 341 transitions. [2024-11-20 08:48:01,187 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 341 transitions. Word has length 148 [2024-11-20 08:48:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:01,188 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 341 transitions. [2024-11-20 08:48:01,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:48:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 341 transitions. [2024-11-20 08:48:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-20 08:48:01,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:01,192 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:01,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 08:48:01,193 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:01,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash -677846963, now seen corresponding path program 1 times [2024-11-20 08:48:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:48:01,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736467256] [2024-11-20 08:48:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:48:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:48:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:48:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:48:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:48:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:48:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:48:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:48:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:48:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:48:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:48:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:48:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:48:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:48:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:48:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:48:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:48:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:48:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:48:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:48:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:48:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736467256] [2024-11-20 08:48:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736467256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:48:01,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:48:01,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:48:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452366300] [2024-11-20 08:48:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:48:01,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:48:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:48:01,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:48:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:48:01,510 INFO L87 Difference]: Start difference. First operand 260 states and 341 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:48:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:01,643 INFO L93 Difference]: Finished difference Result 686 states and 894 transitions. [2024-11-20 08:48:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:48:01,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-20 08:48:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:01,651 INFO L225 Difference]: With dead ends: 686 [2024-11-20 08:48:01,651 INFO L226 Difference]: Without dead ends: 429 [2024-11-20 08:48:01,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:48:01,653 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:01,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 572 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:48:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-20 08:48:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 364. [2024-11-20 08:48:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 325 states have (on average 1.2615384615384615) internal successors, (410), 328 states have internal predecessors, (410), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 08:48:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 474 transitions. [2024-11-20 08:48:01,707 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 474 transitions. Word has length 149 [2024-11-20 08:48:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:01,708 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 474 transitions. [2024-11-20 08:48:01,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:48:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 474 transitions. [2024-11-20 08:48:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-20 08:48:01,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:01,709 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:01,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 08:48:01,709 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:01,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:01,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1556193567, now seen corresponding path program 1 times [2024-11-20 08:48:01,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:48:01,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708781699] [2024-11-20 08:48:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:01,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:48:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:48:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:48:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:48:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:48:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:48:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:48:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:48:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:48:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:48:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:48:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:48:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:48:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:48:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:48:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:48:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:48:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:48:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:48:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:48:02,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:48:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708781699] [2024-11-20 08:48:02,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708781699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:48:02,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:48:02,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 08:48:02,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458859773] [2024-11-20 08:48:02,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:48:02,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:48:02,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:48:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:48:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:48:02,624 INFO L87 Difference]: Start difference. First operand 364 states and 474 transitions. Second operand has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 08:48:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:03,048 INFO L93 Difference]: Finished difference Result 715 states and 925 transitions. [2024-11-20 08:48:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:48:03,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 149 [2024-11-20 08:48:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:03,051 INFO L225 Difference]: With dead ends: 715 [2024-11-20 08:48:03,053 INFO L226 Difference]: Without dead ends: 713 [2024-11-20 08:48:03,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-20 08:48:03,054 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 421 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:03,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1272 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:48:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-11-20 08:48:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 531. [2024-11-20 08:48:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 492 states have (on average 1.2642276422764227) internal successors, (622), 495 states have internal predecessors, (622), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 08:48:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 686 transitions. [2024-11-20 08:48:03,084 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 686 transitions. Word has length 149 [2024-11-20 08:48:03,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:03,085 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 686 transitions. [2024-11-20 08:48:03,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 08:48:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 686 transitions. [2024-11-20 08:48:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-20 08:48:03,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:03,086 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:03,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 08:48:03,086 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:03,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:03,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1291615483, now seen corresponding path program 1 times [2024-11-20 08:48:03,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:48:03,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639405814] [2024-11-20 08:48:03,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:48:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:48:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:48:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:48:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:48:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:48:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:48:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:48:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:48:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:48:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:48:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:48:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:48:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:48:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:48:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:48:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:48:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:48:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:48:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:48:03,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:48:03,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639405814] [2024-11-20 08:48:03,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639405814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:48:03,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:48:03,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:48:03,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711009073] [2024-11-20 08:48:03,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:48:03,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:48:03,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:48:03,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:48:03,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:48:03,242 INFO L87 Difference]: Start difference. First operand 531 states and 686 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:48:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:03,312 INFO L93 Difference]: Finished difference Result 1111 states and 1429 transitions. [2024-11-20 08:48:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:48:03,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-20 08:48:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:03,315 INFO L225 Difference]: With dead ends: 1111 [2024-11-20 08:48:03,315 INFO L226 Difference]: Without dead ends: 583 [2024-11-20 08:48:03,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:48:03,317 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:03,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 865 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:48:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-20 08:48:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 539. [2024-11-20 08:48:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 500 states have (on average 1.26) internal successors, (630), 503 states have internal predecessors, (630), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 08:48:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 694 transitions. [2024-11-20 08:48:03,349 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 694 transitions. Word has length 149 [2024-11-20 08:48:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:03,349 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 694 transitions. [2024-11-20 08:48:03,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:48:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 694 transitions. [2024-11-20 08:48:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 08:48:03,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:03,352 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:03,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 08:48:03,353 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:03,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:03,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1424706267, now seen corresponding path program 1 times [2024-11-20 08:48:03,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:48:03,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857820903] [2024-11-20 08:48:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:03,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:48:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:48:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:48:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:48:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:48:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:48:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:48:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:48:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:48:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:48:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:48:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:48:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:48:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:48:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:48:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:48:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:48:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:48:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:48:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-20 08:48:03,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:48:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857820903] [2024-11-20 08:48:03,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857820903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:48:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246846616] [2024-11-20 08:48:03,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:03,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:48:03,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:48:03,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:48:04,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:48:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:04,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 08:48:04,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:48:04,439 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-11-20 08:48:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 173 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-20 08:48:04,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:48:05,027 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 32 treesize of output 28 [2024-11-20 08:48:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-20 08:48:05,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246846616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:48:05,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:48:05,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 24 [2024-11-20 08:48:05,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934758663] [2024-11-20 08:48:05,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:48:05,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 08:48:05,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:48:05,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 08:48:05,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2024-11-20 08:48:05,064 INFO L87 Difference]: Start difference. First operand 539 states and 694 transitions. Second operand has 24 states, 20 states have (on average 8.1) internal successors, (162), 23 states have internal predecessors, (162), 9 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 6 states have call predecessors, (54), 9 states have call successors, (54) [2024-11-20 08:48:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:06,216 INFO L93 Difference]: Finished difference Result 1393 states and 1788 transitions. [2024-11-20 08:48:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-20 08:48:06,216 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 8.1) internal successors, (162), 23 states have internal predecessors, (162), 9 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 6 states have call predecessors, (54), 9 states have call successors, (54) Word has length 151 [2024-11-20 08:48:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:06,219 INFO L225 Difference]: With dead ends: 1393 [2024-11-20 08:48:06,220 INFO L226 Difference]: Without dead ends: 857 [2024-11-20 08:48:06,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=413, Invalid=1939, Unknown=0, NotChecked=0, Total=2352 [2024-11-20 08:48:06,222 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 631 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:06,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1412 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:48:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-20 08:48:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 824. [2024-11-20 08:48:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 747 states have (on average 1.2570281124497993) internal successors, (939), 751 states have internal predecessors, (939), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 08:48:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1059 transitions. [2024-11-20 08:48:06,418 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1059 transitions. Word has length 151 [2024-11-20 08:48:06,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:06,418 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1059 transitions. [2024-11-20 08:48:06,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 8.1) internal successors, (162), 23 states have internal predecessors, (162), 9 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 6 states have call predecessors, (54), 9 states have call successors, (54) [2024-11-20 08:48:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1059 transitions. [2024-11-20 08:48:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 08:48:06,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:06,420 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:06,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 08:48:06,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-20 08:48:06,621 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:06,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:06,621 INFO L85 PathProgramCache]: Analyzing trace with hash -23093025, now seen corresponding path program 1 times [2024-11-20 08:48:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:48:06,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957636738] [2024-11-20 08:48:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:06,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:48:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:48:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:48:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:48:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:48:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:48:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:48:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:48:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:48:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:48:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:48:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:48:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:48:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:48:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:48:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:48:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:48:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:48:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:48:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-20 08:48:07,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:48:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957636738] [2024-11-20 08:48:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957636738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:48:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696496333] [2024-11-20 08:48:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:07,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:48:07,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:48:07,209 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:48:07,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 08:48:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:07,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-20 08:48:07,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:48:07,772 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-11-20 08:48:08,583 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-11-20 08:48:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 401 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-20 08:48:09,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:48:09,773 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 32 treesize of output 28 [2024-11-20 08:48:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 111 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2024-11-20 08:48:09,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696496333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:48:09,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:48:09,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 15] total 42 [2024-11-20 08:48:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927560473] [2024-11-20 08:48:09,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:48:09,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-20 08:48:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:48:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-20 08:48:09,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2024-11-20 08:48:09,813 INFO L87 Difference]: Start difference. First operand 824 states and 1059 transitions. Second operand has 42 states, 35 states have (on average 4.685714285714286) internal successors, (164), 39 states have internal predecessors, (164), 11 states have call successors, (54), 6 states have call predecessors, (54), 9 states have return successors, (54), 6 states have call predecessors, (54), 11 states have call successors, (54) [2024-11-20 08:48:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:11,889 INFO L93 Difference]: Finished difference Result 1638 states and 2084 transitions. [2024-11-20 08:48:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-20 08:48:11,895 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 4.685714285714286) internal successors, (164), 39 states have internal predecessors, (164), 11 states have call successors, (54), 6 states have call predecessors, (54), 9 states have return successors, (54), 6 states have call predecessors, (54), 11 states have call successors, (54) Word has length 151 [2024-11-20 08:48:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:11,898 INFO L225 Difference]: With dead ends: 1638 [2024-11-20 08:48:11,902 INFO L226 Difference]: Without dead ends: 817 [2024-11-20 08:48:11,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1315, Invalid=5657, Unknown=0, NotChecked=0, Total=6972 [2024-11-20 08:48:11,909 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1445 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:11,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1617 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:48:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-11-20 08:48:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 682. [2024-11-20 08:48:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 603 states have (on average 1.2504145936981759) internal successors, (754), 605 states have internal predecessors, (754), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 08:48:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 866 transitions. [2024-11-20 08:48:12,025 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 866 transitions. Word has length 151 [2024-11-20 08:48:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:12,025 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 866 transitions. [2024-11-20 08:48:12,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 4.685714285714286) internal successors, (164), 39 states have internal predecessors, (164), 11 states have call successors, (54), 6 states have call predecessors, (54), 9 states have return successors, (54), 6 states have call predecessors, (54), 11 states have call successors, (54) [2024-11-20 08:48:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 866 transitions. [2024-11-20 08:48:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 08:48:12,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:12,027 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:12,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 08:48:12,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-20 08:48:12,228 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1876991241, now seen corresponding path program 1 times [2024-11-20 08:48:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:48:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862314726] [2024-11-20 08:48:12,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:48:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:48:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:48:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:48:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:48:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:48:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:48:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:48:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:48:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:48:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:48:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:48:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:48:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:48:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:48:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:48:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:48:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:48:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:48:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-20 08:48:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:48:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862314726] [2024-11-20 08:48:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862314726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:48:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979957034] [2024-11-20 08:48:12,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:12,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:48:12,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:48:12,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:48:12,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 08:48:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:12,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 08:48:12,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:48:12,983 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-11-20 08:48:13,119 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 11 [2024-11-20 08:48:13,192 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 19 treesize of output 11 [2024-11-20 08:48:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 10 proven. 338 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 08:48:13,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:48:13,438 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 23 [2024-11-20 08:48:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-20 08:48:13,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979957034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:48:13,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:48:13,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2024-11-20 08:48:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466321254] [2024-11-20 08:48:13,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:48:13,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 08:48:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:48:13,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 08:48:13,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-11-20 08:48:13,493 INFO L87 Difference]: Start difference. First operand 682 states and 866 transitions. Second operand has 21 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) [2024-11-20 08:48:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:14,359 INFO L93 Difference]: Finished difference Result 1321 states and 1659 transitions. [2024-11-20 08:48:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-20 08:48:14,360 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) Word has length 152 [2024-11-20 08:48:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:14,362 INFO L225 Difference]: With dead ends: 1321 [2024-11-20 08:48:14,362 INFO L226 Difference]: Without dead ends: 642 [2024-11-20 08:48:14,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=395, Invalid=1327, Unknown=0, NotChecked=0, Total=1722 [2024-11-20 08:48:14,364 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 443 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:14,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 881 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:48:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-20 08:48:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 622. [2024-11-20 08:48:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 539 states have (on average 1.217068645640074) internal successors, (656), 541 states have internal predecessors, (656), 56 states have call successors, (56), 26 states have call predecessors, (56), 26 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 08:48:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 768 transitions. [2024-11-20 08:48:14,460 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 768 transitions. Word has length 152 [2024-11-20 08:48:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:14,461 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 768 transitions. [2024-11-20 08:48:14,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 8 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 5 states have call predecessors, (54), 8 states have call successors, (54) [2024-11-20 08:48:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 768 transitions. [2024-11-20 08:48:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 08:48:14,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:14,463 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:14,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 08:48:14,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:48:14,668 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:14,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1154017022, now seen corresponding path program 1 times [2024-11-20 08:48:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:48:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854488933] [2024-11-20 08:48:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:48:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:48:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:48:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:48:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:48:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:48:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:48:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:48:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:48:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:48:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:48:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:48:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:48:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:48:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:48:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:48:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:48:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:48:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:48:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:48:15,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:48:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854488933] [2024-11-20 08:48:15,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854488933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:48:15,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:48:15,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:48:15,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176286037] [2024-11-20 08:48:15,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:48:15,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:48:15,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:48:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:48:15,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:48:15,078 INFO L87 Difference]: Start difference. First operand 622 states and 768 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:48:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:15,400 INFO L93 Difference]: Finished difference Result 1155 states and 1420 transitions. [2024-11-20 08:48:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 08:48:15,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-11-20 08:48:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:15,405 INFO L225 Difference]: With dead ends: 1155 [2024-11-20 08:48:15,406 INFO L226 Difference]: Without dead ends: 777 [2024-11-20 08:48:15,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:48:15,407 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 101 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:15,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1788 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:48:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-20 08:48:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 765. [2024-11-20 08:48:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 645 states have (on average 1.206201550387597) internal successors, (778), 649 states have internal predecessors, (778), 80 states have call successors, (80), 39 states have call predecessors, (80), 39 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-20 08:48:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 938 transitions. [2024-11-20 08:48:15,500 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 938 transitions. Word has length 153 [2024-11-20 08:48:15,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:15,501 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 938 transitions. [2024-11-20 08:48:15,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:48:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 938 transitions. [2024-11-20 08:48:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 08:48:15,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:15,502 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:15,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 08:48:15,502 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:15,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash 31194103, now seen corresponding path program 1 times [2024-11-20 08:48:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:48:15,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568829961] [2024-11-20 08:48:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:48:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:48:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:48:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:48:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:48:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:48:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:48:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:48:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:48:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:48:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:48:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:48:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:48:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:48:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:48:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:48:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:48:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:48:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:48:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 84 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2024-11-20 08:48:16,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:48:16,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568829961] [2024-11-20 08:48:16,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568829961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:48:16,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831748847] [2024-11-20 08:48:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:16,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:48:16,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:48:16,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:48:16,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 08:48:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:16,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-20 08:48:16,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:48:17,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 3 [2024-11-20 08:48:17,477 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-11-20 08:48:18,154 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-11-20 08:48:18,816 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-11-20 08:48:18,819 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-11-20 08:48:18,824 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 26 treesize of output 14 [2024-11-20 08:48:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 496 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-20 08:48:18,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:48:19,251 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 64 treesize of output 60 [2024-11-20 08:48:20,167 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 154 treesize of output 142 [2024-11-20 08:48:43,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831748847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:48:43,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:48:43,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 38 [2024-11-20 08:48:43,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365753506] [2024-11-20 08:48:43,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:48:43,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-20 08:48:43,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:48:43,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-20 08:48:43,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=2859, Unknown=0, NotChecked=0, Total=3192 [2024-11-20 08:48:43,840 INFO L87 Difference]: Start difference. First operand 765 states and 938 transitions. Second operand has 38 states, 30 states have (on average 4.9) internal successors, (147), 30 states have internal predecessors, (147), 16 states have call successors, (36), 9 states have call predecessors, (36), 10 states have return successors, (36), 12 states have call predecessors, (36), 16 states have call successors, (36) [2024-11-20 08:48:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:46,327 INFO L93 Difference]: Finished difference Result 1154 states and 1401 transitions. [2024-11-20 08:48:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-20 08:48:46,328 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 4.9) internal successors, (147), 30 states have internal predecessors, (147), 16 states have call successors, (36), 9 states have call predecessors, (36), 10 states have return successors, (36), 12 states have call predecessors, (36), 16 states have call successors, (36) Word has length 154 [2024-11-20 08:48:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:46,330 INFO L225 Difference]: With dead ends: 1154 [2024-11-20 08:48:46,330 INFO L226 Difference]: Without dead ends: 392 [2024-11-20 08:48:46,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=1335, Invalid=6147, Unknown=0, NotChecked=0, Total=7482 [2024-11-20 08:48:46,333 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1153 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:46,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1378 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:48:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-20 08:48:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 373. [2024-11-20 08:48:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 300 states have (on average 1.1666666666666667) internal successors, (350), 302 states have internal predecessors, (350), 46 states have call successors, (46), 26 states have call predecessors, (46), 26 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-20 08:48:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 442 transitions. [2024-11-20 08:48:46,404 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 442 transitions. Word has length 154 [2024-11-20 08:48:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:46,405 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 442 transitions. [2024-11-20 08:48:46,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 4.9) internal successors, (147), 30 states have internal predecessors, (147), 16 states have call successors, (36), 9 states have call predecessors, (36), 10 states have return successors, (36), 12 states have call predecessors, (36), 16 states have call successors, (36) [2024-11-20 08:48:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 442 transitions. [2024-11-20 08:48:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 08:48:46,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:46,409 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:46,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 08:48:46,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:48:46,610 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:46,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:46,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1883236905, now seen corresponding path program 1 times [2024-11-20 08:48:46,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:48:46,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793808595] [2024-11-20 08:48:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:48:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:48:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:48:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:48:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:48:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:48:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:48:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:48:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:48:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:48:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:48:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:48:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:48:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:48:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:48:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:48:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:48:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:48:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:48:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:48:47,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:48:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793808595] [2024-11-20 08:48:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793808595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:48:47,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:48:47,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 08:48:47,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088062856] [2024-11-20 08:48:47,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:48:47,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 08:48:47,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:48:47,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 08:48:47,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:48:47,674 INFO L87 Difference]: Start difference. First operand 373 states and 442 transitions. Second operand has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 08:48:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:48,595 INFO L93 Difference]: Finished difference Result 654 states and 775 transitions. [2024-11-20 08:48:48,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 08:48:48,595 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 157 [2024-11-20 08:48:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:48,597 INFO L225 Difference]: With dead ends: 654 [2024-11-20 08:48:48,597 INFO L226 Difference]: Without dead ends: 351 [2024-11-20 08:48:48,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2024-11-20 08:48:48,598 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 208 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:48,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 981 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:48:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-20 08:48:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-20 08:48:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 278 states have (on average 1.1654676258992807) internal successors, (324), 280 states have internal predecessors, (324), 46 states have call successors, (46), 26 states have call predecessors, (46), 26 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-20 08:48:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 416 transitions. [2024-11-20 08:48:48,663 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 416 transitions. Word has length 157 [2024-11-20 08:48:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:48,663 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 416 transitions. [2024-11-20 08:48:48,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-20 08:48:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 416 transitions. [2024-11-20 08:48:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 08:48:48,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:48,664 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:48,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 08:48:48,664 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:48,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash 109272837, now seen corresponding path program 1 times [2024-11-20 08:48:48,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:48:48,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439993821] [2024-11-20 08:48:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:48:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:48:48,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:48:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:48:48,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:48:48,892 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:48:48,893 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:48:48,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 08:48:48,898 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:49,080 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:48:49,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:48:49 BoogieIcfgContainer [2024-11-20 08:48:49,083 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:48:49,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:48:49,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:48:49,084 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:48:49,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:47:43" (3/4) ... [2024-11-20 08:48:49,086 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:48:49,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:48:49,087 INFO L158 Benchmark]: Toolchain (without parser) took 67127.38ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 116.0MB in the beginning and 892.4MB in the end (delta: -776.4MB). Peak memory consumption was 229.8MB. Max. memory is 16.1GB. [2024-11-20 08:48:49,087 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:48:49,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.23ms. Allocated memory is still 186.6MB. Free memory was 115.7MB in the beginning and 99.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 08:48:49,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.12ms. Allocated memory is still 186.6MB. Free memory was 99.6MB in the beginning and 95.9MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 08:48:49,088 INFO L158 Benchmark]: Boogie Preprocessor took 68.19ms. Allocated memory is still 186.6MB. Free memory was 95.9MB in the beginning and 89.9MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 08:48:49,088 INFO L158 Benchmark]: RCFGBuilder took 848.97ms. Allocated memory is still 186.6MB. Free memory was 89.6MB in the beginning and 129.8MB in the end (delta: -40.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-20 08:48:49,088 INFO L158 Benchmark]: TraceAbstraction took 65877.25ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 128.6MB in the beginning and 892.4MB in the end (delta: -763.8MB). Peak memory consumption was 242.6MB. Max. memory is 16.1GB. [2024-11-20 08:48:49,089 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 1.2GB. Free memory is still 892.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:48:49,089 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.14ms. Allocated memory is still 121.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.23ms. Allocated memory is still 186.6MB. Free memory was 115.7MB in the beginning and 99.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.12ms. Allocated memory is still 186.6MB. Free memory was 99.6MB in the beginning and 95.9MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.19ms. Allocated memory is still 186.6MB. Free memory was 95.9MB in the beginning and 89.9MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 848.97ms. Allocated memory is still 186.6MB. Free memory was 89.6MB in the beginning and 129.8MB in the end (delta: -40.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 65877.25ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 128.6MB in the beginning and 892.4MB in the end (delta: -763.8MB). Peak memory consumption was 242.6MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 1.2GB. Free memory is still 892.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned long int var_1_3 = 1456677701; [L24] unsigned long int var_1_3 = 1456677701; [L25] unsigned long int* var_1_3_Pointer = &(var_1_3); [L26] unsigned long int var_1_4 = 1000000000; [L26] unsigned long int var_1_4 = 1000000000; [L27] unsigned long int* var_1_4_Pointer = &(var_1_4); [L28] unsigned long int var_1_5 = 1; [L28] unsigned long int var_1_5 = 1; [L29] unsigned long int* var_1_5_Pointer = &(var_1_5); [L30] unsigned char var_1_6 = 0; [L30] unsigned char var_1_6 = 0; [L31] unsigned char* var_1_6_Pointer = &(var_1_6); [L32] unsigned char var_1_7 = 0; [L32] unsigned char var_1_7 = 0; [L33] unsigned char* var_1_7_Pointer = &(var_1_7); [L34] unsigned char var_1_8 = 0; [L34] unsigned char var_1_8 = 0; [L35] unsigned char* var_1_8_Pointer = &(var_1_8); [L36] double var_1_9 = 256.5; [L36] double var_1_9 = 256.5; [L37] double* var_1_9_Pointer = &(var_1_9); [L38] double var_1_10 = 8.8; [L38] double var_1_10 = 8.8; [L39] double* var_1_10_Pointer = &(var_1_10); [L40] unsigned char var_1_11 = 1; [L40] unsigned char var_1_11 = 1; [L41] unsigned char* var_1_11_Pointer = &(var_1_11); [L42] unsigned short int var_1_12 = 16; [L42] unsigned short int var_1_12 = 16; [L43] unsigned short int* var_1_12_Pointer = &(var_1_12); [L44] unsigned long int var_1_13 = 3110219175; [L44] unsigned long int var_1_13 = 3110219175; [L45] unsigned long int* var_1_13_Pointer = &(var_1_13); [L46] unsigned short int var_1_14 = 128; [L46] unsigned short int var_1_14 = 128; [L47] unsigned short int* var_1_14_Pointer = &(var_1_14); [L48] unsigned char var_1_15 = 1; [L48] unsigned char var_1_15 = 1; [L49] unsigned char* var_1_15_Pointer = &(var_1_15); [L50] unsigned char var_1_16 = 0; [L50] unsigned char var_1_16 = 0; [L51] unsigned char* var_1_16_Pointer = &(var_1_16); VAL [isInitial=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] FCALL updateLastVariables() [L122] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_ulong() [L83] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] var_1_4 = __VERIFIER_nondet_ulong() [L86] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] var_1_5 = __VERIFIER_nondet_ulong() [L89] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] var_1_9 = __VERIFIER_nondet_double() [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] var_1_10 = __VERIFIER_nondet_double() [L97] EXPR \read(var_1_10) [L97] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F [L97] EXPR \read(var_1_10) [L97] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] var_1_11 = __VERIFIER_nondet_uchar() [L99] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] var_1_13 = __VERIFIER_nondet_ulong() [L102] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] var_1_14 = __VERIFIER_nondet_ushort() [L105] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] var_1_16 = __VERIFIER_nondet_uchar() [L108] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] RET updateVariables() [L123] CALL step() [L55] EXPR \read(*var_1_7_Pointer) [L55] (*(var_1_6_Pointer)) = (*(var_1_7_Pointer)) [L56] EXPR \read(*var_1_5_Pointer) [L56] EXPR \read(*var_1_13_Pointer) [L56] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L56] COND TRUE (*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))) [L57] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L57] EXPR \read(*var_1_14_Pointer) [L57] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] (*(var_1_12_Pointer)) = (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L59] COND TRUE ((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer)) [L60] EXPR \read(*var_1_11_Pointer) [L60] (*(var_1_15_Pointer)) = (! (*(var_1_11_Pointer))) [L64] EXPR \read(*var_1_12_Pointer) [L64] EXPR \read(*var_1_3_Pointer) [L64] EXPR \read(*var_1_4_Pointer) [L64] EXPR \read(*var_1_12_Pointer) [L64] (*(var_1_1_Pointer)) = ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L65] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L65] signed long int stepLocal_1 = ((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer)))); [L66] EXPR \read(*var_1_3_Pointer) [L66] unsigned long int stepLocal_0 = (*(var_1_3_Pointer)); [L67] EXPR \read(*var_1_4_Pointer) [L67] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) [L67] EXPR \read(*var_1_4_Pointer) [L67] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, stepLocal_0=-3221225472, stepLocal_1=65534, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] COND TRUE stepLocal_1 != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) [L68] EXPR \read(*var_1_9_Pointer) [L68] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L68] COND FALSE !((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR \read(*var_1_1_Pointer) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_3_Pointer) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) [L114] EXPR \read(*var_1_6_Pointer) [L114] EXPR \read(*var_1_7_Pointer) [L114] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer))))) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) [L114] EXPR \read(*var_1_9_Pointer) [L114] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1 [L114] EXPR ((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1 VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1) [L114] EXPR \read(*var_1_5_Pointer) [L114] EXPR \read(*var_1_13_Pointer) [L114] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1 [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L114] EXPR \read(*var_1_14_Pointer) [L114] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1 VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) [L114] EXPR \read(*var_1_9_Pointer) [L114] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer))))) [L114] EXPR \read(*var_1_15_Pointer) [L114] EXPR \read(*var_1_11_Pointer) [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_16_Pointer)) [L114] EXPR \read(*var_1_16_Pointer) [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114-L115] return (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.6s, OverallIterations: 27, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7829 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7828 mSDsluCounter, 25920 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21955 mSDsCounter, 1517 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9329 IncrementalHoareTripleChecker+Invalid, 10846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1517 mSolverCounterUnsat, 3965 mSDtfsCounter, 9329 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2646 GetRequests, 2135 SyntacticMatches, 3 SemanticMatches, 508 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4080 ImplicationChecksByTransitivity, 33.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred in iteration=21, InterpolantAutomatonStates: 315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 1126 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 45.4s InterpolantComputationTime, 4593 NumberOfCodeBlocks, 4593 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4856 ConstructedInterpolants, 0 QuantifiedInterpolants, 30327 SizeOfPredicates, 46 NumberOfNonLiveVariables, 2721 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 33 InterpolantComputations, 22 PerfectInterpolantSequences, 18371/20196 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 08:48:49,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:48:51,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:48:51,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:48:51,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:48:51,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:48:51,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:48:51,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:48:51,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:48:51,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:48:51,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:48:51,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:48:51,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:48:51,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:48:51,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:48:51,322 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:48:51,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:48:51,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:48:51,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:48:51,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:48:51,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:48:51,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:48:51,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:48:51,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:48:51,324 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:48:51,324 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:48:51,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:48:51,324 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:48:51,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:48:51,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:48:51,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:48:51,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:48:51,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:48:51,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:48:51,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:48:51,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:48:51,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:48:51,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:48:51,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:48:51,327 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:48:51,327 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:48:51,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:48:51,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:48:51,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:48:51,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:48:51,328 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 [2024-11-20 08:48:51,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:48:51,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:48:51,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:48:51,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:48:51,655 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:48:51,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2024-11-20 08:48:53,223 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:48:53,530 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:48:53,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2024-11-20 08:48:53,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a765ff2/2037227ced6b474dafa58b38a1df4678/FLAGa1269f6f8 [2024-11-20 08:48:53,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a765ff2/2037227ced6b474dafa58b38a1df4678 [2024-11-20 08:48:53,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:48:53,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:48:53,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:48:53,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:48:53,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:48:53,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:53,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c38180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53, skipping insertion in model container [2024-11-20 08:48:53,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:53,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:48:53,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-11-20 08:48:53,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:48:53,931 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:48:53,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-11-20 08:48:53,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:48:53,994 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:48:53,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53 WrapperNode [2024-11-20 08:48:53,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:48:53,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:48:53,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:48:53,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:48:54,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,055 INFO L138 Inliner]: procedures = 36, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 528 [2024-11-20 08:48:54,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:48:54,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:48:54,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:48:54,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:48:54,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,114 INFO L175 MemorySlicer]: Split 133 memory accesses to 16 slices as follows [2, 3, 12, 12, 6, 5, 10, 7, 10, 10, 12, 17, 6, 10, 5, 6]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-11-20 08:48:54,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:48:54,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:48:54,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:48:54,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:48:54,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (1/1) ... [2024-11-20 08:48:54,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:48:54,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:48:54,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:48:54,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:48:54,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:48:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-20 08:48:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-20 08:48:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-20 08:48:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-20 08:48:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-20 08:48:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-20 08:48:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-20 08:48:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-20 08:48:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-20 08:48:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-20 08:48:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-20 08:48:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-20 08:48:54,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-20 08:48:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-20 08:48:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-20 08:48:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-20 08:48:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-20 08:48:54,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-11-20 08:48:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2024-11-20 08:48:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 08:48:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 08:48:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 08:48:54,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 08:48:54,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 08:48:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 08:48:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 08:48:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-20 08:48:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-20 08:48:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-20 08:48:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-20 08:48:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-20 08:48:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-20 08:48:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-20 08:48:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-20 08:48:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-20 08:48:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-20 08:48:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-11-20 08:48:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 08:48:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 08:48:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 08:48:54,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 08:48:54,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-20 08:48:54,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-20 08:48:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-20 08:48:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-20 08:48:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-20 08:48:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-20 08:48:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-20 08:48:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-20 08:48:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-20 08:48:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-20 08:48:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-20 08:48:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-11-20 08:48:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-20 08:48:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-20 08:48:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-20 08:48:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-20 08:48:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-20 08:48:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-20 08:48:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-20 08:48:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-20 08:48:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-20 08:48:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-20 08:48:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-20 08:48:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-20 08:48:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-20 08:48:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-20 08:48:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-11-20 08:48:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2024-11-20 08:48:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 08:48:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 08:48:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 08:48:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-20 08:48:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-20 08:48:54,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:48:54,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:48:54,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 08:48:54,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-20 08:48:54,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-20 08:48:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-20 08:48:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-20 08:48:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-20 08:48:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-20 08:48:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-20 08:48:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-20 08:48:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-20 08:48:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-20 08:48:54,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-20 08:48:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-11-20 08:48:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-11-20 08:48:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 08:48:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 08:48:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 08:48:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-20 08:48:54,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-20 08:48:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-20 08:48:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-20 08:48:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-20 08:48:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-20 08:48:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-20 08:48:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-20 08:48:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-20 08:48:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-20 08:48:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-20 08:48:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-20 08:48:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-11-20 08:48:54,499 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:48:54,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:48:55,310 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-20 08:48:55,311 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:48:55,337 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:48:55,339 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:48:55,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:48:55 BoogieIcfgContainer [2024-11-20 08:48:55,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:48:55,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:48:55,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:48:55,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:48:55,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:48:53" (1/3) ... [2024-11-20 08:48:55,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f2687e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:48:55, skipping insertion in model container [2024-11-20 08:48:55,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:53" (2/3) ... [2024-11-20 08:48:55,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f2687e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:48:55, skipping insertion in model container [2024-11-20 08:48:55,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:48:55" (3/3) ... [2024-11-20 08:48:55,347 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2024-11-20 08:48:55,360 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:48:55,361 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:48:55,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:48:55,425 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;@254d1555, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:48:55,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:48:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:48:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:48:55,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:55,442 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:55,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:55,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1513522922, now seen corresponding path program 1 times [2024-11-20 08:48:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:48:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828980979] [2024-11-20 08:48:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:55,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:48:55,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:48:55,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:48:55,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 08:48:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:55,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:48:55,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:48:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-20 08:48:55,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:48:55,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:48:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828980979] [2024-11-20 08:48:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828980979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:48:55,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:48:55,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:48:55,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103509686] [2024-11-20 08:48:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:48:55,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:48:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:48:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:48:55,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:48:55,963 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:48:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:56,010 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2024-11-20 08:48:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:48:56,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-20 08:48:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:56,024 INFO L225 Difference]: With dead ends: 217 [2024-11-20 08:48:56,025 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 08:48:56,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:48:56,045 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:56,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:48:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 08:48:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-20 08:48:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:48:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-11-20 08:48:56,123 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2024-11-20 08:48:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:56,124 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-11-20 08:48:56,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:48:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-11-20 08:48:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:48:56,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:56,128 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:56,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 08:48:56,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:48:56,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:56,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -202382474, now seen corresponding path program 1 times [2024-11-20 08:48:56,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:48:56,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480644532] [2024-11-20 08:48:56,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:56,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:48:56,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:48:56,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:48:56,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 08:48:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:56,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 08:48:56,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:48:57,127 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 13 [2024-11-20 08:48:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:48:57,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:48:57,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:48:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480644532] [2024-11-20 08:48:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480644532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:48:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:48:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:48:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093142120] [2024-11-20 08:48:57,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:48:57,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:48:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:48:57,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:48:57,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:48:57,167 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:48:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:48:57,356 INFO L93 Difference]: Finished difference Result 318 states and 459 transitions. [2024-11-20 08:48:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:48:57,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-20 08:48:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:48:57,362 INFO L225 Difference]: With dead ends: 318 [2024-11-20 08:48:57,362 INFO L226 Difference]: Without dead ends: 213 [2024-11-20 08:48:57,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:48:57,366 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 81 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:48:57,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 428 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:48:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-20 08:48:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2024-11-20 08:48:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 170 states have (on average 1.3588235294117648) internal successors, (231), 170 states have internal predecessors, (231), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:48:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 303 transitions. [2024-11-20 08:48:57,405 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 303 transitions. Word has length 140 [2024-11-20 08:48:57,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:48:57,407 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 303 transitions. [2024-11-20 08:48:57,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:48:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 303 transitions. [2024-11-20 08:48:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:48:57,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:48:57,413 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:48:57,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 08:48:57,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:48:57,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:48:57,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:48:57,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1223450828, now seen corresponding path program 1 times [2024-11-20 08:48:57,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:48:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159371291] [2024-11-20 08:48:57,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:57,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:48:57,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:48:57,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:48:57,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 08:48:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:57,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 08:48:57,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:48:58,709 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 10 [2024-11-20 08:48:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 20 proven. 222 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-20 08:48:58,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:48:58,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:48:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159371291] [2024-11-20 08:48:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159371291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:48:58,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [543079646] [2024-11-20 08:48:58,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:48:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:48:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:48:58,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:48:58,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-20 08:48:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:48:59,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 08:48:59,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:48:59,739 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-11-20 08:49:00,693 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 15 treesize of output 7 [2024-11-20 08:49:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 173 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-20 08:49:00,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:49:00,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [543079646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:49:00,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:49:00,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2024-11-20 08:49:00,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111579224] [2024-11-20 08:49:00,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:49:00,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 08:49:00,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:49:00,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 08:49:00,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2024-11-20 08:49:00,795 INFO L87 Difference]: Start difference. First operand 209 states and 303 transitions. Second operand has 24 states, 21 states have (on average 5.190476190476191) internal successors, (109), 20 states have internal predecessors, (109), 7 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36)