./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-55.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 ccb56227f27c303c0b7ed9911790f620e0785ecbf8516ea22da1a21accd7569d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:35:24,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:35:24,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:35:24,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:35:24,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:35:24,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:35:24,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:35:24,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:35:24,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:35:24,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:35:24,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:35:24,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:35:24,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:35:24,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:35:24,766 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:35:24,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:35:24,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:35:24,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:35:24,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:35:24,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:35:24,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:35:24,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:35:24,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:35:24,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:35:24,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:35:24,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:35:24,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:35:24,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:35:24,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:35:24,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:35:24,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:35:24,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:35:24,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:35:24,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:35:24,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:35:24,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:35:24,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:35:24,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:35:24,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:35:24,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:35:24,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:35:24,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:35:24,778 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 -> ccb56227f27c303c0b7ed9911790f620e0785ecbf8516ea22da1a21accd7569d [2024-11-16 18:35:24,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:35:25,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:35:25,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:35:25,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:35:25,020 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:35:25,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-55.i [2024-11-16 18:35:26,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:35:26,613 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:35:26,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-55.i [2024-11-16 18:35:26,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c59ebbb69/7d9b928bf8cb41f9a2880acf33d465c7/FLAG5bc4a7a07 [2024-11-16 18:35:26,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c59ebbb69/7d9b928bf8cb41f9a2880acf33d465c7 [2024-11-16 18:35:26,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:35:26,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:35:26,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:35:26,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:35:26,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:35:26,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:35:26" (1/1) ... [2024-11-16 18:35:26,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aed7459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:26, skipping insertion in model container [2024-11-16 18:35:26,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:35:26" (1/1) ... [2024-11-16 18:35:27,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:35:27,216 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-55.i[916,929] [2024-11-16 18:35:27,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:35:27,310 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:35:27,321 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-55.i[916,929] [2024-11-16 18:35:27,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:35:27,380 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:35:27,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27 WrapperNode [2024-11-16 18:35:27,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:35:27,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:35:27,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:35:27,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:35:27,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,453 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 480 [2024-11-16 18:35:27,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:35:27,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:35:27,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:35:27,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:35:27,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,502 INFO L175 MemorySlicer]: Split 108 memory accesses to 15 slices as follows [2, 19, 8, 6, 3, 10, 8, 8, 8, 6, 10, 3, 3, 8, 6]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2024-11-16 18:35:27,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:35:27,554 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:35:27,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:35:27,555 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:35:27,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (1/1) ... [2024-11-16 18:35:27,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:35:27,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:35:27,597 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-16 18:35:27,600 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-16 18:35:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:35:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-16 18:35:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-16 18:35:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-16 18:35:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-16 18:35:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-16 18:35:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-16 18:35:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-16 18:35:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-16 18:35:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-16 18:35:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-16 18:35:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-16 18:35:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-16 18:35:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-16 18:35:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-16 18:35:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-16 18:35:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 18:35:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 18:35:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 18:35:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 18:35:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 18:35:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-16 18:35:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-16 18:35:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-16 18:35:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-16 18:35:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-16 18:35:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-16 18:35:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-16 18:35:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-16 18:35:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-16 18:35:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-16 18:35:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 18:35:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 18:35:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-16 18:35:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-16 18:35:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-16 18:35:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-16 18:35:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-16 18:35:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-16 18:35:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-16 18:35:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-16 18:35:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-16 18:35:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-16 18:35:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-16 18:35:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-16 18:35:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-16 18:35:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 18:35:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 18:35:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 18:35:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 18:35:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 18:35:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-16 18:35:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-16 18:35:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-16 18:35:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-16 18:35:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-16 18:35:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-16 18:35:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-16 18:35:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-16 18:35:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-16 18:35:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-16 18:35:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-16 18:35:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-16 18:35:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-16 18:35:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-16 18:35:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-16 18:35:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-16 18:35:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-16 18:35:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-16 18:35:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-16 18:35:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-16 18:35:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-16 18:35:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-16 18:35:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-16 18:35:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:35:27,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-16 18:35:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-16 18:35:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-16 18:35:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-16 18:35:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-16 18:35:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-16 18:35:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-16 18:35:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-16 18:35:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:35:27,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:35:27,839 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:35:27,840 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:35:28,253 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~mem74#1;havoc property_#t~ite82#1;havoc property_#t~mem75#1;havoc property_#t~short76#1;havoc property_#t~ite80#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem83#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~bitwise93#1;havoc property_#t~mem94#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~bitwise96#1;havoc property_#t~mem97#1;havoc property_#t~ite107#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~short111#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~short114#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short117#1; [2024-11-16 18:35:28,308 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-16 18:35:28,308 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:35:28,330 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:35:28,331 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:35:28,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:35:28 BoogieIcfgContainer [2024-11-16 18:35:28,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:35:28,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:35:28,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:35:28,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:35:28,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:35:26" (1/3) ... [2024-11-16 18:35:28,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152d148d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:35:28, skipping insertion in model container [2024-11-16 18:35:28,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:27" (2/3) ... [2024-11-16 18:35:28,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152d148d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:35:28, skipping insertion in model container [2024-11-16 18:35:28,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:35:28" (3/3) ... [2024-11-16 18:35:28,340 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-55.i [2024-11-16 18:35:28,356 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:35:28,356 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:35:28,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:35:28,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;@54d9f47a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:35:28,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:35:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:35:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:35:28,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:28,445 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:28,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:28,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1064661487, now seen corresponding path program 1 times [2024-11-16 18:35:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:28,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884727319] [2024-11-16 18:35:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:28,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884727319] [2024-11-16 18:35:28,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884727319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:28,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:28,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:35:28,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321851229] [2024-11-16 18:35:28,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:28,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:35:28,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:28,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:35:28,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:35:28,956 INFO L87 Difference]: Start difference. First operand has 114 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:35:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:28,998 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2024-11-16 18:35:28,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:35:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-16 18:35:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:29,010 INFO L225 Difference]: With dead ends: 220 [2024-11-16 18:35:29,010 INFO L226 Difference]: Without dead ends: 109 [2024-11-16 18:35:29,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:35:29,019 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:29,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:35:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-16 18:35:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-16 18:35:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:35:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-16 18:35:29,067 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 117 [2024-11-16 18:35:29,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:29,067 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-16 18:35:29,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:35:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-16 18:35:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:35:29,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:29,075 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:29,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:35:29,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:29,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash 77080375, now seen corresponding path program 1 times [2024-11-16 18:35:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:29,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421329898] [2024-11-16 18:35:29,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:29,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:29,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421329898] [2024-11-16 18:35:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421329898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:29,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:29,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:35:29,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516825294] [2024-11-16 18:35:29,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:29,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:35:29,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:29,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:35:29,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:35:29,471 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:29,536 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-11-16 18:35:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:35:29,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-16 18:35:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:29,538 INFO L225 Difference]: With dead ends: 218 [2024-11-16 18:35:29,538 INFO L226 Difference]: Without dead ends: 112 [2024-11-16 18:35:29,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-16 18:35:29,540 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:29,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:35:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-16 18:35:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-16 18:35:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:35:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-16 18:35:29,552 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 117 [2024-11-16 18:35:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:29,554 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-16 18:35:29,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-16 18:35:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:35:29,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:29,557 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:29,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:35:29,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash -119433130, now seen corresponding path program 1 times [2024-11-16 18:35:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:29,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126990133] [2024-11-16 18:35:29,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:29,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126990133] [2024-11-16 18:35:29,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126990133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:29,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:35:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893782134] [2024-11-16 18:35:29,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:29,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:35:29,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:29,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:35:29,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:35:29,839 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:29,890 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-16 18:35:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:35:29,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-16 18:35:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:29,896 INFO L225 Difference]: With dead ends: 222 [2024-11-16 18:35:29,896 INFO L226 Difference]: Without dead ends: 114 [2024-11-16 18:35:29,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-16 18:35:29,901 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:29,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:35:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-16 18:35:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-16 18:35:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:35:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-16 18:35:29,919 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 117 [2024-11-16 18:35:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:29,920 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-16 18:35:29,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-16 18:35:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:35:29,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:29,923 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:29,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:35:29,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:29,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1623377205, now seen corresponding path program 1 times [2024-11-16 18:35:29,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:29,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860822996] [2024-11-16 18:35:29,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:29,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:30,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:30,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860822996] [2024-11-16 18:35:30,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860822996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:30,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:30,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:35:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545063291] [2024-11-16 18:35:30,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:30,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:35:30,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:30,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:35:30,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:35:30,156 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:30,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:30,193 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2024-11-16 18:35:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:35:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-16 18:35:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:30,195 INFO L225 Difference]: With dead ends: 226 [2024-11-16 18:35:30,195 INFO L226 Difference]: Without dead ends: 116 [2024-11-16 18:35:30,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-16 18:35:30,200 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:30,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:35:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-16 18:35:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-16 18:35:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:35:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-16 18:35:30,216 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 117 [2024-11-16 18:35:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:30,216 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-16 18:35:30,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-16 18:35:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:35:30,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:30,220 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:30,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:35:30,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:30,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1652006356, now seen corresponding path program 1 times [2024-11-16 18:35:30,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:30,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769258482] [2024-11-16 18:35:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:30,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:30,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:30,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769258482] [2024-11-16 18:35:30,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769258482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:30,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:30,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:35:30,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43117798] [2024-11-16 18:35:30,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:30,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:35:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:30,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:35:30,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:35:30,403 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:30,423 INFO L93 Difference]: Finished difference Result 227 states and 323 transitions. [2024-11-16 18:35:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:35:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-16 18:35:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:30,426 INFO L225 Difference]: With dead ends: 227 [2024-11-16 18:35:30,426 INFO L226 Difference]: Without dead ends: 115 [2024-11-16 18:35:30,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:35:30,428 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:30,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:35:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-16 18:35:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-16 18:35:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:35:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 162 transitions. [2024-11-16 18:35:30,444 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 162 transitions. Word has length 117 [2024-11-16 18:35:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:30,445 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 162 transitions. [2024-11-16 18:35:30,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 162 transitions. [2024-11-16 18:35:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 18:35:30,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:30,446 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:30,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:35:30,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:30,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:30,449 INFO L85 PathProgramCache]: Analyzing trace with hash -656599978, now seen corresponding path program 1 times [2024-11-16 18:35:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434112338] [2024-11-16 18:35:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:30,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:30,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434112338] [2024-11-16 18:35:30,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434112338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:30,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:30,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:35:30,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202407319] [2024-11-16 18:35:30,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:30,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:35:30,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:30,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:35:30,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:35:30,811 INFO L87 Difference]: Start difference. First operand 115 states and 162 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:30,881 INFO L93 Difference]: Finished difference Result 286 states and 400 transitions. [2024-11-16 18:35:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:35:30,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-16 18:35:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:30,884 INFO L225 Difference]: With dead ends: 286 [2024-11-16 18:35:30,884 INFO L226 Difference]: Without dead ends: 174 [2024-11-16 18:35:30,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-16 18:35:30,885 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 73 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:30,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 571 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:35:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-16 18:35:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 117. [2024-11-16 18:35:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 103 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:35:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2024-11-16 18:35:30,900 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 119 [2024-11-16 18:35:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:30,901 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2024-11-16 18:35:30,901 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2024-11-16 18:35:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 18:35:30,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:30,902 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:30,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:35:30,902 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -625580171, now seen corresponding path program 1 times [2024-11-16 18:35:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699676651] [2024-11-16 18:35:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:30,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:31,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:31,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699676651] [2024-11-16 18:35:31,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699676651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:31,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:31,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:35:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127437313] [2024-11-16 18:35:31,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:31,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:35:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:31,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:35:31,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:35:31,412 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:31,672 INFO L93 Difference]: Finished difference Result 405 states and 566 transitions. [2024-11-16 18:35:31,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:35:31,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-16 18:35:31,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:31,676 INFO L225 Difference]: With dead ends: 405 [2024-11-16 18:35:31,676 INFO L226 Difference]: Without dead ends: 291 [2024-11-16 18:35:31,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:35:31,677 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 300 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:31,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 618 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:35:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-16 18:35:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 179. [2024-11-16 18:35:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 152 states have (on average 1.355263157894737) internal successors, (206), 152 states have internal predecessors, (206), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:35:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 254 transitions. [2024-11-16 18:35:31,704 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 254 transitions. Word has length 119 [2024-11-16 18:35:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:31,704 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 254 transitions. [2024-11-16 18:35:31,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 254 transitions. [2024-11-16 18:35:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:35:31,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:31,709 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:31,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:35:31,710 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:31,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1374098754, now seen corresponding path program 1 times [2024-11-16 18:35:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:31,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896744122] [2024-11-16 18:35:31,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:31,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896744122] [2024-11-16 18:35:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896744122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:32,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:32,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:35:32,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13385755] [2024-11-16 18:35:32,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:32,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:35:32,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:35:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:35:32,025 INFO L87 Difference]: Start difference. First operand 179 states and 254 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:32,224 INFO L93 Difference]: Finished difference Result 404 states and 573 transitions. [2024-11-16 18:35:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:35:32,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-16 18:35:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:32,227 INFO L225 Difference]: With dead ends: 404 [2024-11-16 18:35:32,227 INFO L226 Difference]: Without dead ends: 290 [2024-11-16 18:35:32,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:35:32,228 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 146 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:32,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 476 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:35:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-16 18:35:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 282. [2024-11-16 18:35:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 242 states have (on average 1.359504132231405) internal successors, (329), 242 states have internal predecessors, (329), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:35:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 401 transitions. [2024-11-16 18:35:32,242 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 401 transitions. Word has length 120 [2024-11-16 18:35:32,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:32,243 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 401 transitions. [2024-11-16 18:35:32,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 401 transitions. [2024-11-16 18:35:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:35:32,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:32,244 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:32,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:35:32,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:32,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:32,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1702101162, now seen corresponding path program 1 times [2024-11-16 18:35:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:32,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167126753] [2024-11-16 18:35:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:32,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:32,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167126753] [2024-11-16 18:35:32,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167126753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:32,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:32,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:35:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356242328] [2024-11-16 18:35:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:32,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:35:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:32,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:35:32,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:35:32,658 INFO L87 Difference]: Start difference. First operand 282 states and 401 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:32,795 INFO L93 Difference]: Finished difference Result 615 states and 865 transitions. [2024-11-16 18:35:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:35:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-16 18:35:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:32,798 INFO L225 Difference]: With dead ends: 615 [2024-11-16 18:35:32,799 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 18:35:32,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:35:32,800 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 59 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:32,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 628 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:35:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 18:35:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 311. [2024-11-16 18:35:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 271 states have (on average 1.3505535055350553) internal successors, (366), 271 states have internal predecessors, (366), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:35:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 438 transitions. [2024-11-16 18:35:32,815 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 438 transitions. Word has length 121 [2024-11-16 18:35:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:32,816 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 438 transitions. [2024-11-16 18:35:32,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 438 transitions. [2024-11-16 18:35:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:35:32,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:32,817 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:32,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:35:32,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:32,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash 626414425, now seen corresponding path program 1 times [2024-11-16 18:35:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:32,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928291646] [2024-11-16 18:35:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928291646] [2024-11-16 18:35:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928291646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:33,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:35:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397062653] [2024-11-16 18:35:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:33,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:35:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:35:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:35:33,194 INFO L87 Difference]: Start difference. First operand 311 states and 438 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:33,391 INFO L93 Difference]: Finished difference Result 904 states and 1266 transitions. [2024-11-16 18:35:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:35:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-16 18:35:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:33,395 INFO L225 Difference]: With dead ends: 904 [2024-11-16 18:35:33,395 INFO L226 Difference]: Without dead ends: 654 [2024-11-16 18:35:33,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:35:33,397 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 275 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:33,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 848 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:35:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-16 18:35:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 568. [2024-11-16 18:35:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 502 states have (on average 1.342629482071713) internal successors, (674), 502 states have internal predecessors, (674), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:35:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 794 transitions. [2024-11-16 18:35:33,432 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 794 transitions. Word has length 123 [2024-11-16 18:35:33,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:33,432 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 794 transitions. [2024-11-16 18:35:33,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 794 transitions. [2024-11-16 18:35:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:35:33,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:33,435 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:33,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:35:33,435 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:33,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash 977214362, now seen corresponding path program 1 times [2024-11-16 18:35:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361692834] [2024-11-16 18:35:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:33,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361692834] [2024-11-16 18:35:33,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361692834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:33,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:33,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:35:33,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92609911] [2024-11-16 18:35:33,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:33,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:35:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:33,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:35:33,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:35:33,921 INFO L87 Difference]: Start difference. First operand 568 states and 794 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 18:35:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:34,133 INFO L93 Difference]: Finished difference Result 1249 states and 1738 transitions. [2024-11-16 18:35:34,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:35:34,133 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 123 [2024-11-16 18:35:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:34,137 INFO L225 Difference]: With dead ends: 1249 [2024-11-16 18:35:34,137 INFO L226 Difference]: Without dead ends: 741 [2024-11-16 18:35:34,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:35:34,139 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 213 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:34,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 877 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:35:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-16 18:35:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 568. [2024-11-16 18:35:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 502 states have (on average 1.3306772908366533) internal successors, (668), 502 states have internal predecessors, (668), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:35:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 788 transitions. [2024-11-16 18:35:34,171 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 788 transitions. Word has length 123 [2024-11-16 18:35:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:34,171 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 788 transitions. [2024-11-16 18:35:34,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 18:35:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 788 transitions. [2024-11-16 18:35:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:35:34,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:34,173 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:34,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:35:34,174 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:34,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash 658123992, now seen corresponding path program 1 times [2024-11-16 18:35:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:34,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606466122] [2024-11-16 18:35:34,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:34,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:34,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606466122] [2024-11-16 18:35:34,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606466122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:34,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:34,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:35:34,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481652299] [2024-11-16 18:35:34,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:34,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:35:34,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:35:34,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:35:34,633 INFO L87 Difference]: Start difference. First operand 568 states and 788 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 18:35:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:34,820 INFO L93 Difference]: Finished difference Result 1249 states and 1726 transitions. [2024-11-16 18:35:34,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:35:34,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 123 [2024-11-16 18:35:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:34,824 INFO L225 Difference]: With dead ends: 1249 [2024-11-16 18:35:34,825 INFO L226 Difference]: Without dead ends: 741 [2024-11-16 18:35:34,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:35:34,826 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 275 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:34,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 630 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:35:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-16 18:35:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 606. [2024-11-16 18:35:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 540 states have (on average 1.3407407407407408) internal successors, (724), 540 states have internal predecessors, (724), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:35:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 844 transitions. [2024-11-16 18:35:34,857 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 844 transitions. Word has length 123 [2024-11-16 18:35:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:34,858 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 844 transitions. [2024-11-16 18:35:34,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 18:35:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 844 transitions. [2024-11-16 18:35:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:35:34,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:34,860 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:34,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:35:34,860 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:34,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:34,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2129291495, now seen corresponding path program 1 times [2024-11-16 18:35:34,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:34,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145587767] [2024-11-16 18:35:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:35,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145587767] [2024-11-16 18:35:35,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145587767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:35,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:35,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:35:35,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566895151] [2024-11-16 18:35:35,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:35,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:35:35,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:35,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:35:35,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:35:35,048 INFO L87 Difference]: Start difference. First operand 606 states and 844 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:35,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:35,096 INFO L93 Difference]: Finished difference Result 1164 states and 1620 transitions. [2024-11-16 18:35:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:35:35,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-16 18:35:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:35,099 INFO L225 Difference]: With dead ends: 1164 [2024-11-16 18:35:35,100 INFO L226 Difference]: Without dead ends: 618 [2024-11-16 18:35:35,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-16 18:35:35,101 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:35,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 579 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:35:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-16 18:35:35,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2024-11-16 18:35:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 552 states have (on average 1.3333333333333333) internal successors, (736), 552 states have internal predecessors, (736), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:35:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 856 transitions. [2024-11-16 18:35:35,130 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 856 transitions. Word has length 123 [2024-11-16 18:35:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:35,130 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 856 transitions. [2024-11-16 18:35:35,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 856 transitions. [2024-11-16 18:35:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:35:35,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:35,132 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:35,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 18:35:35,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:35,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1143466664, now seen corresponding path program 1 times [2024-11-16 18:35:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286086976] [2024-11-16 18:35:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:35,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286086976] [2024-11-16 18:35:35,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286086976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:35,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:35,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:35:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739250753] [2024-11-16 18:35:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:35,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:35:35,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:35,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:35:35,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:35:35,285 INFO L87 Difference]: Start difference. First operand 618 states and 856 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:35,341 INFO L93 Difference]: Finished difference Result 1200 states and 1660 transitions. [2024-11-16 18:35:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:35:35,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-16 18:35:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:35,345 INFO L225 Difference]: With dead ends: 1200 [2024-11-16 18:35:35,345 INFO L226 Difference]: Without dead ends: 642 [2024-11-16 18:35:35,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-16 18:35:35,349 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:35,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:35:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-16 18:35:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 634. [2024-11-16 18:35:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 568 states have (on average 1.323943661971831) internal successors, (752), 568 states have internal predecessors, (752), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:35:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 872 transitions. [2024-11-16 18:35:35,380 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 872 transitions. Word has length 124 [2024-11-16 18:35:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:35,381 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 872 transitions. [2024-11-16 18:35:35,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 872 transitions. [2024-11-16 18:35:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 18:35:35,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:35,382 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:35,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 18:35:35,383 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:35,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1982265239, now seen corresponding path program 1 times [2024-11-16 18:35:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:35,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166929493] [2024-11-16 18:35:35,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:35,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:35,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:35,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166929493] [2024-11-16 18:35:35,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166929493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:35,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:35,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:35:35,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499577849] [2024-11-16 18:35:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:35,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:35:35,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:35,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:35:35,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:35:35,537 INFO L87 Difference]: Start difference. First operand 634 states and 872 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:35,604 INFO L93 Difference]: Finished difference Result 1379 states and 1882 transitions. [2024-11-16 18:35:35,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:35:35,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-16 18:35:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:35,608 INFO L225 Difference]: With dead ends: 1379 [2024-11-16 18:35:35,608 INFO L226 Difference]: Without dead ends: 797 [2024-11-16 18:35:35,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:35:35,610 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 47 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:35,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 442 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:35:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-16 18:35:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 610. [2024-11-16 18:35:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 544 states have (on average 1.3088235294117647) internal successors, (712), 544 states have internal predecessors, (712), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:35:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 832 transitions. [2024-11-16 18:35:35,639 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 832 transitions. Word has length 126 [2024-11-16 18:35:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:35,639 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 832 transitions. [2024-11-16 18:35:35,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 832 transitions. [2024-11-16 18:35:35,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 18:35:35,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:35,641 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:35,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 18:35:35,641 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:35,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1715423082, now seen corresponding path program 1 times [2024-11-16 18:35:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575178329] [2024-11-16 18:35:35,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:35,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:35:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:35:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:35:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:35:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:35:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:35:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:35:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:35:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:35:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:35:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:35:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:35:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:35,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:35:35,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575178329] [2024-11-16 18:35:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575178329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:35,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:35,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:35:35,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584376244] [2024-11-16 18:35:35,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:35,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:35:35,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:35:35,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:35:35,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:35:35,832 INFO L87 Difference]: Start difference. First operand 610 states and 832 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:35,978 INFO L93 Difference]: Finished difference Result 1256 states and 1700 transitions. [2024-11-16 18:35:35,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:35:35,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-16 18:35:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:35,982 INFO L225 Difference]: With dead ends: 1256 [2024-11-16 18:35:35,982 INFO L226 Difference]: Without dead ends: 706 [2024-11-16 18:35:35,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:35:35,983 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 213 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:35,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 784 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:35:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-16 18:35:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 610. [2024-11-16 18:35:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 544 states have (on average 1.2941176470588236) internal successors, (704), 544 states have internal predecessors, (704), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:35:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 824 transitions. [2024-11-16 18:35:36,017 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 824 transitions. Word has length 128 [2024-11-16 18:35:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:36,017 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 824 transitions. [2024-11-16 18:35:36,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 824 transitions. [2024-11-16 18:35:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 18:35:36,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:36,018 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:36,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 18:35:36,037 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:36,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2124247307, now seen corresponding path program 1 times [2024-11-16 18:35:36,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:35:36,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499608849] [2024-11-16 18:35:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:35:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:35:36,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:35:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:35:36,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:35:36,252 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:35:36,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:35:36,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 18:35:36,259 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:36,439 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:35:36,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:35:36 BoogieIcfgContainer [2024-11-16 18:35:36,441 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:35:36,442 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:35:36,442 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:35:36,442 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:35:36,443 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:35:28" (3/4) ... [2024-11-16 18:35:36,445 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:35:36,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:35:36,446 INFO L158 Benchmark]: Toolchain (without parser) took 9463.73ms. Allocated memory was 169.9MB in the beginning and 323.0MB in the end (delta: 153.1MB). Free memory was 113.0MB in the beginning and 207.6MB in the end (delta: -94.7MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2024-11-16 18:35:36,448 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.4MB in the beginning and 50.3MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:35:36,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.89ms. Allocated memory is still 169.9MB. Free memory was 113.0MB in the beginning and 133.3MB in the end (delta: -20.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 18:35:36,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.04ms. Allocated memory is still 169.9MB. Free memory was 133.3MB in the beginning and 129.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:35:36,449 INFO L158 Benchmark]: Boogie Preprocessor took 99.79ms. Allocated memory is still 169.9MB. Free memory was 129.9MB in the beginning and 124.3MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:35:36,449 INFO L158 Benchmark]: IcfgBuilder took 777.35ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 80.1MB in the end (delta: 44.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-16 18:35:36,450 INFO L158 Benchmark]: TraceAbstraction took 8107.73ms. Allocated memory was 169.9MB in the beginning and 323.0MB in the end (delta: 153.1MB). Free memory was 79.4MB in the beginning and 207.6MB in the end (delta: -128.3MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-11-16 18:35:36,450 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 323.0MB. Free memory is still 207.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:35:36,452 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.17ms. Allocated memory is still 96.5MB. Free memory was 50.4MB in the beginning and 50.3MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.89ms. Allocated memory is still 169.9MB. Free memory was 113.0MB in the beginning and 133.3MB in the end (delta: -20.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.04ms. Allocated memory is still 169.9MB. Free memory was 133.3MB in the beginning and 129.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.79ms. Allocated memory is still 169.9MB. Free memory was 129.9MB in the beginning and 124.3MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 777.35ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 80.1MB in the end (delta: 44.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8107.73ms. Allocated memory was 169.9MB in the beginning and 323.0MB in the end (delta: 153.1MB). Free memory was 79.4MB in the beginning and 207.6MB in the end (delta: -128.3MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 323.0MB. Free memory is still 207.6MB. 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 111, overapproximation of shiftRight at line 74, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L22] unsigned short int var_1_1 = 10; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_5 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] double var_1_7 = 256.75; [L28] double var_1_7 = 256.75; [L29] double* var_1_7_Pointer = &(var_1_7); [L30] double var_1_8 = 63.5; [L30] double var_1_8 = 63.5; [L31] double* var_1_8_Pointer = &(var_1_8); [L32] double var_1_9 = 1.8; [L32] double var_1_9 = 1.8; [L33] double* var_1_9_Pointer = &(var_1_9); [L34] double var_1_10 = 0.25; [L34] double var_1_10 = 0.25; [L35] double* var_1_10_Pointer = &(var_1_10); [L36] double var_1_11 = 16.5; [L36] double var_1_11 = 16.5; [L37] double* var_1_11_Pointer = &(var_1_11); [L38] signed long int var_1_12 = -5; [L38] signed long int var_1_12 = -5; [L39] signed long int* var_1_12_Pointer = &(var_1_12); [L40] unsigned char var_1_14 = 128; [L40] unsigned char var_1_14 = 128; [L41] unsigned char* var_1_14_Pointer = &(var_1_14); [L42] float var_1_15 = 4.6; [L42] float var_1_15 = 4.6; [L43] float* var_1_15_Pointer = &(var_1_15); [L44] unsigned long int var_1_16 = 500; [L44] unsigned long int var_1_16 = 500; [L45] unsigned long int* var_1_16_Pointer = &(var_1_16); [L46] unsigned char var_1_17 = 2; [L46] unsigned char var_1_17 = 2; [L47] unsigned char* var_1_17_Pointer = &(var_1_17); [L48] unsigned char var_1_18 = 100; [L48] unsigned char var_1_18 = 100; [L49] unsigned char* var_1_18_Pointer = &(var_1_18); [L50] signed long int last_1_var_1_12 = -5; [L51] unsigned char last_1_var_1_17 = 2; VAL [isInitial=0, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L107] EXPR \read(var_1_12) [L107] last_1_var_1_12 = var_1_12 [L108] EXPR \read(var_1_17) [L108] last_1_var_1_17 = var_1_17 [L118] RET updateLastVariables() [L119] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] var_1_5 = __VERIFIER_nondet_uchar() [L89] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] var_1_8 = __VERIFIER_nondet_double() [L92] EXPR \read(var_1_8) [L92] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F [L92] EXPR \read(var_1_8) [L92] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR (var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR (var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] var_1_9 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_9) [L94] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F [L94] EXPR \read(var_1_9) [L94] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR (var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR (var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] var_1_10 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_10) [L96] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F [L96] EXPR \read(var_1_10) [L96] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] var_1_11 = __VERIFIER_nondet_double() [L98] EXPR \read(var_1_11) [L98] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F [L98] EXPR \read(var_1_11) [L98] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] var_1_14 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] var_1_18 = __VERIFIER_nondet_uchar() [L103] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] RET updateVariables() [L120] CALL step() [L55] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L56] signed long int stepLocal_0 = last_1_var_1_17; [L57] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L57] COND TRUE (*(var_1_2_Pointer)) [L58] stepLocal_1 && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L58] stepLocal_1 && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L58] COND FALSE !(stepLocal_1 && (*(var_1_5_Pointer))) [L68] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L68] COND TRUE (*(var_1_2_Pointer)) [L69] EXPR \read(*var_1_8_Pointer) [L69] EXPR \read(*var_1_9_Pointer) [L69] EXPR \read(*var_1_10_Pointer) [L69] EXPR \read(*var_1_11_Pointer) [L69] (*(var_1_7_Pointer)) = ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))) [L71] EXPR \read(*var_1_8_Pointer) [L71] (*(var_1_15_Pointer)) = (*(var_1_8_Pointer)) [L72] EXPR \read(*var_1_14_Pointer) [L72] (*(var_1_16_Pointer)) = (*(var_1_14_Pointer)) [L73] EXPR \read(*var_1_18_Pointer) [L73] (*(var_1_17_Pointer)) = (*(var_1_18_Pointer)) [L74] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] EXPR -4 >> (*(var_1_1_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] EXPR (((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer))) [L74] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] EXPR -4 >> (*(var_1_1_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] EXPR (((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] signed long int stepLocal_3 = ((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))); [L75] EXPR \read(*var_1_1_Pointer) [L75] signed long int stepLocal_2 = (*(var_1_1_Pointer)) / -8; [L76] EXPR \read(*var_1_17_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] COND FALSE !((~ (*(var_1_17_Pointer))) <= stepLocal_3) [L81] EXPR \read(*var_1_17_Pointer) [L81] EXPR \read(*var_1_14_Pointer) [L81] (*(var_1_12_Pointer)) = ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17)) [L111] EXPR (last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1 [L111] EXPR ((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1) [L111] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1 [L111] EXPR \read(*var_1_7_Pointer) [L111] EXPR \read(*var_1_8_Pointer) [L111] EXPR \read(*var_1_9_Pointer) [L111] EXPR \read(*var_1_10_Pointer) [L111] EXPR \read(*var_1_11_Pointer) [L111] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer))))) && ((*(var_1_16_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer))))) && ((*(var_1_16_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer))))) && ((*(var_1_16_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer))))) && ((*(var_1_16_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111-L112] return ((((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer))))) && ((*(var_1_16_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 17, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1604 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1604 mSDsluCounter, 8810 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6275 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1169 IncrementalHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 2535 mSDtfsCounter, 1169 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=14, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 948 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2062 NumberOfCodeBlocks, 2062 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1918 ConstructedInterpolants, 0 QuantifiedInterpolants, 3227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 4224/4224 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-16 18:35:36,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-55.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 ccb56227f27c303c0b7ed9911790f620e0785ecbf8516ea22da1a21accd7569d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:35:38,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:35:38,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:35:38,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:35:38,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:35:38,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:35:38,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:35:38,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:35:38,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:35:38,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:35:38,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:35:38,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:35:38,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:35:38,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:35:38,829 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:35:38,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:35:38,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:35:38,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:35:38,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:35:38,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:35:38,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:35:38,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:35:38,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:35:38,834 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:35:38,834 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:35:38,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:35:38,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:35:38,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:35:38,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:35:38,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:35:38,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:35:38,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:35:38,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:35:38,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:35:38,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:35:38,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:35:38,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:35:38,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:35:38,837 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:35:38,838 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:35:38,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:35:38,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:35:38,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:35:38,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:35:38,840 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 -> ccb56227f27c303c0b7ed9911790f620e0785ecbf8516ea22da1a21accd7569d [2024-11-16 18:35:39,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:35:39,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:35:39,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:35:39,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:35:39,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:35:39,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-55.i [2024-11-16 18:35:40,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:35:40,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:35:40,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-55.i [2024-11-16 18:35:40,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f09883728/2e4e3f326cf145ac992d6f619cd7520c/FLAGcc77983f1 [2024-11-16 18:35:40,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f09883728/2e4e3f326cf145ac992d6f619cd7520c [2024-11-16 18:35:40,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:35:40,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:35:40,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:35:40,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:35:40,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:35:40,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:35:40" (1/1) ... [2024-11-16 18:35:40,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b12dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:40, skipping insertion in model container [2024-11-16 18:35:40,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:35:40" (1/1) ... [2024-11-16 18:35:41,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:35:41,189 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-55.i[916,929] [2024-11-16 18:35:41,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:35:41,285 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:35:41,299 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-55.i[916,929] [2024-11-16 18:35:41,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:35:41,377 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:35:41,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41 WrapperNode [2024-11-16 18:35:41,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:35:41,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:35:41,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:35:41,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:35:41,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,454 INFO L138 Inliner]: procedures = 39, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2024-11-16 18:35:41,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:35:41,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:35:41,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:35:41,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:35:41,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,527 INFO L175 MemorySlicer]: Split 108 memory accesses to 15 slices as follows [2, 19, 8, 6, 3, 10, 8, 8, 8, 6, 10, 3, 3, 8, 6]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2024-11-16 18:35:41,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:35:41,590 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:35:41,590 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:35:41,590 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:35:41,591 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (1/1) ... [2024-11-16 18:35:41,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:35:41,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:35:41,624 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-16 18:35:41,627 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-16 18:35:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:35:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-16 18:35:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-16 18:35:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-16 18:35:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-16 18:35:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-16 18:35:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-16 18:35:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-16 18:35:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-16 18:35:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-16 18:35:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-16 18:35:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-16 18:35:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-16 18:35:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-16 18:35:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-16 18:35:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-16 18:35:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-16 18:35:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-16 18:35:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-16 18:35:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-16 18:35:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-11-16 18:35:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:35:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:35:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-16 18:35:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-16 18:35:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-16 18:35:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-16 18:35:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-16 18:35:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-16 18:35:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-16 18:35:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-16 18:35:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-16 18:35:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-16 18:35:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-16 18:35:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-16 18:35:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-16 18:35:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-16 18:35:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-16 18:35:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-16 18:35:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-16 18:35:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-16 18:35:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:35:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-16 18:35:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-16 18:35:41,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-16 18:35:41,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-16 18:35:41,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-16 18:35:41,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-16 18:35:41,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-16 18:35:41,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-16 18:35:41,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-16 18:35:41,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-16 18:35:41,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-16 18:35:41,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-16 18:35:41,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-16 18:35:41,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-16 18:35:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-16 18:35:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-16 18:35:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-16 18:35:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-16 18:35:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:35:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-16 18:35:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-16 18:35:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-11-16 18:35:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-16 18:35:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-16 18:35:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-16 18:35:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-16 18:35:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-16 18:35:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-16 18:35:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-16 18:35:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-16 18:35:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-16 18:35:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-16 18:35:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-16 18:35:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-16 18:35:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-16 18:35:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-16 18:35:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-16 18:35:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-16 18:35:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-16 18:35:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-16 18:35:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-16 18:35:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-16 18:35:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-11-16 18:35:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:35:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:35:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-16 18:35:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-16 18:35:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-16 18:35:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-16 18:35:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-16 18:35:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-16 18:35:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-16 18:35:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-16 18:35:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-16 18:35:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-16 18:35:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-16 18:35:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-16 18:35:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-16 18:35:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-16 18:35:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-11-16 18:35:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:35:41,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:35:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:35:41,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:35:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:35:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:35:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-16 18:35:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-16 18:35:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-16 18:35:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-16 18:35:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-16 18:35:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-16 18:35:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 18:35:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-16 18:35:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-16 18:35:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-16 18:35:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-16 18:35:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-16 18:35:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-16 18:35:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-16 18:35:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-16 18:35:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-16 18:35:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-16 18:35:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-16 18:35:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-16 18:35:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-16 18:35:42,050 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:35:42,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:35:46,965 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~mem72#1;havoc property_#t~ite80#1;havoc property_#t~mem73#1;havoc property_#t~short74#1;havoc property_#t~ite78#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite103#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1; [2024-11-16 18:35:47,002 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-16 18:35:47,002 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:35:47,017 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:35:47,017 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:35:47,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:35:47 BoogieIcfgContainer [2024-11-16 18:35:47,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:35:47,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:35:47,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:35:47,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:35:47,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:35:40" (1/3) ... [2024-11-16 18:35:47,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac241e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:35:47, skipping insertion in model container [2024-11-16 18:35:47,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:35:41" (2/3) ... [2024-11-16 18:35:47,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac241e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:35:47, skipping insertion in model container [2024-11-16 18:35:47,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:35:47" (3/3) ... [2024-11-16 18:35:47,025 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-55.i [2024-11-16 18:35:47,040 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:35:47,041 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:35:47,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:35:47,119 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;@72d7878f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:35:47,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:35:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 88 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:35:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:35:47,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:47,140 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:47,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:47,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:47,147 INFO L85 PathProgramCache]: Analyzing trace with hash 94960492, now seen corresponding path program 1 times [2024-11-16 18:35:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:35:47,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636941575] [2024-11-16 18:35:47,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:47,164 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-16 18:35:47,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:35:47,167 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-16 18:35:47,168 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-16 18:35:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:47,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:35:47,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:35:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-16 18:35:47,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:35:47,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:35:47,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636941575] [2024-11-16 18:35:47,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636941575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:47,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:47,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:35:47,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696906326] [2024-11-16 18:35:47,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:47,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:35:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:35:48,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:35:48,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:35:48,014 INFO L87 Difference]: Start difference. First operand has 102 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 88 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:35:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:48,049 INFO L93 Difference]: Finished difference Result 196 states and 303 transitions. [2024-11-16 18:35:48,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:35:48,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-16 18:35:48,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:48,058 INFO L225 Difference]: With dead ends: 196 [2024-11-16 18:35:48,058 INFO L226 Difference]: Without dead ends: 97 [2024-11-16 18:35:48,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-16 18:35:48,064 INFO L432 NwaCegarLoop]: 139 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, 139 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-16 18:35:48,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:35:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-16 18:35:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-16 18:35:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:35:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-16 18:35:48,105 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 115 [2024-11-16 18:35:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:48,105 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-16 18:35:48,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:35:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-16 18:35:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:35:48,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:48,108 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:48,129 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-16 18:35:48,309 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-16 18:35:48,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:48,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash 621306548, now seen corresponding path program 1 times [2024-11-16 18:35:48,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:35:48,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828626946] [2024-11-16 18:35:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:48,311 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-16 18:35:48,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:35:48,313 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-16 18:35:48,314 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-16 18:35:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:49,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:35:49,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:35:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-16 18:35:49,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:35:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:50,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:35:50,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828626946] [2024-11-16 18:35:50,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828626946] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:35:50,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:35:50,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-16 18:35:50,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033113584] [2024-11-16 18:35:50,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:50,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:35:50,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:35:50,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:35:50,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:35:50,178 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:51,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:35:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:52,014 INFO L93 Difference]: Finished difference Result 232 states and 331 transitions. [2024-11-16 18:35:52,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:35:52,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-16 18:35:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:52,018 INFO L225 Difference]: With dead ends: 232 [2024-11-16 18:35:52,018 INFO L226 Difference]: Without dead ends: 138 [2024-11-16 18:35:52,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:35:52,022 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 56 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:52,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 518 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 18:35:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-16 18:35:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2024-11-16 18:35:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:35:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-16 18:35:52,037 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 115 [2024-11-16 18:35:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:52,039 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-16 18:35:52,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-16 18:35:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:35:52,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:52,043 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:52,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 18:35:52,243 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-16 18:35:52,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:52,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1416749741, now seen corresponding path program 1 times [2024-11-16 18:35:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:35:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925706533] [2024-11-16 18:35:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:52,245 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-16 18:35:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:35:52,247 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-16 18:35:52,248 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-16 18:35:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:52,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 18:35:52,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:35:52,821 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-16 18:35:53,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-16 18:35:53,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2024-11-16 18:35:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:53,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:35:53,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:35:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925706533] [2024-11-16 18:35:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925706533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:53,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:53,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:35:53,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959609793] [2024-11-16 18:35:53,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:53,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:35:53,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:35:53,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:35:53,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:35:53,303 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:54,567 INFO L93 Difference]: Finished difference Result 335 states and 477 transitions. [2024-11-16 18:35:54,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:35:54,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-16 18:35:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:54,572 INFO L225 Difference]: With dead ends: 335 [2024-11-16 18:35:54,572 INFO L226 Difference]: Without dead ends: 239 [2024-11-16 18:35:54,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:35:54,576 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 195 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:54,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 805 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 18:35:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-16 18:35:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 168. [2024-11-16 18:35:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 141 states have (on average 1.3687943262411348) internal successors, (193), 141 states have internal predecessors, (193), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:35:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2024-11-16 18:35:54,618 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 115 [2024-11-16 18:35:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:54,618 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2024-11-16 18:35:54,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2024-11-16 18:35:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:35:54,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:54,620 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:54,637 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 (4)] Ended with exit code 0 [2024-11-16 18:35:54,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:35:54,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:54,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:54,823 INFO L85 PathProgramCache]: Analyzing trace with hash 581200406, now seen corresponding path program 1 times [2024-11-16 18:35:54,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:35:54,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939346495] [2024-11-16 18:35:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:54,824 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-16 18:35:54,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:35:54,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:35:54,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 18:35:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:55,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 18:35:55,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:35:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:55,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:35:55,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:35:55,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939346495] [2024-11-16 18:35:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939346495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:35:55,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:35:55,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:35:55,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068091839] [2024-11-16 18:35:55,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:55,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:35:55,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:35:55,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:35:55,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:35:55,807 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:56,158 INFO L93 Difference]: Finished difference Result 414 states and 590 transitions. [2024-11-16 18:35:56,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:35:56,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-16 18:35:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:56,164 INFO L225 Difference]: With dead ends: 414 [2024-11-16 18:35:56,164 INFO L226 Difference]: Without dead ends: 305 [2024-11-16 18:35:56,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:35:56,168 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 214 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:56,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 756 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:35:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-16 18:35:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 265. [2024-11-16 18:35:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 225 states have (on average 1.3555555555555556) internal successors, (305), 225 states have internal predecessors, (305), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:35:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 377 transitions. [2024-11-16 18:35:56,222 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 377 transitions. Word has length 117 [2024-11-16 18:35:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:56,223 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 377 transitions. [2024-11-16 18:35:56,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 377 transitions. [2024-11-16 18:35:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:35:56,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:56,226 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:56,245 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 (5)] Ended with exit code 0 [2024-11-16 18:35:56,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-16 18:35:56,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:56,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1496008937, now seen corresponding path program 1 times [2024-11-16 18:35:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:35:56,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582298650] [2024-11-16 18:35:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:56,428 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-16 18:35:56,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:35:56,431 INFO L229 MonitoredProcess]: Starting monitored process 6 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-16 18:35:56,432 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 (6)] Waiting until timeout for monitored process [2024-11-16 18:35:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:57,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:35:57,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:35:57,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-16 18:35:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-16 18:35:57,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:35:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:35:58,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:35:58,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582298650] [2024-11-16 18:35:58,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582298650] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:35:58,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:35:58,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-16 18:35:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643407083] [2024-11-16 18:35:58,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:35:58,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:35:58,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:35:58,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:35:58,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:35:58,027 INFO L87 Difference]: Start difference. First operand 265 states and 377 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:35:58,165 INFO L93 Difference]: Finished difference Result 539 states and 766 transitions. [2024-11-16 18:35:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:35:58,166 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-16 18:35:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:35:58,168 INFO L225 Difference]: With dead ends: 539 [2024-11-16 18:35:58,169 INFO L226 Difference]: Without dead ends: 345 [2024-11-16 18:35:58,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:35:58,170 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 104 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:35:58,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 488 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:35:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-16 18:35:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 281. [2024-11-16 18:35:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 241 states have (on average 1.3485477178423237) internal successors, (325), 241 states have internal predecessors, (325), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:35:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 397 transitions. [2024-11-16 18:35:58,190 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 397 transitions. Word has length 117 [2024-11-16 18:35:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:35:58,191 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 397 transitions. [2024-11-16 18:35:58,191 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:35:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 397 transitions. [2024-11-16 18:35:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:35:58,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:35:58,193 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:35:58,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-16 18:35:58,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-16 18:35:58,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:35:58,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:35:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1746589077, now seen corresponding path program 1 times [2024-11-16 18:35:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:35:58,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051182849] [2024-11-16 18:35:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:35:58,395 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-16 18:35:58,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:35:58,396 INFO L229 MonitoredProcess]: Starting monitored process 7 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-16 18:35:58,397 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 (7)] Waiting until timeout for monitored process [2024-11-16 18:35:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:35:59,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:35:59,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:35:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-16 18:35:59,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:36:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:00,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051182849] [2024-11-16 18:36:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051182849] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:36:00,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:36:00,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-16 18:36:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927952884] [2024-11-16 18:36:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:00,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:36:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:36:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:36:00,072 INFO L87 Difference]: Start difference. First operand 281 states and 397 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:02,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:36:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:02,532 INFO L93 Difference]: Finished difference Result 555 states and 783 transitions. [2024-11-16 18:36:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:36:02,533 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-16 18:36:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:02,535 INFO L225 Difference]: With dead ends: 555 [2024-11-16 18:36:02,536 INFO L226 Difference]: Without dead ends: 345 [2024-11-16 18:36:02,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:36:02,537 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 92 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:02,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 388 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-16 18:36:02,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-16 18:36:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 300. [2024-11-16 18:36:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 260 states have (on average 1.3576923076923078) internal successors, (353), 260 states have internal predecessors, (353), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:36:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 425 transitions. [2024-11-16 18:36:02,556 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 425 transitions. Word has length 117 [2024-11-16 18:36:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:02,557 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 425 transitions. [2024-11-16 18:36:02,557 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 425 transitions. [2024-11-16 18:36:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:36:02,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:02,558 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:02,581 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 (7)] Ended with exit code 0 [2024-11-16 18:36:02,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-16 18:36:02,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:02,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1040826410, now seen corresponding path program 1 times [2024-11-16 18:36:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665187890] [2024-11-16 18:36:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:02,764 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-16 18:36:02,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:02,765 INFO L229 MonitoredProcess]: Starting monitored process 8 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-16 18:36:02,766 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 (8)] Waiting until timeout for monitored process [2024-11-16 18:36:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:03,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:36:03,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:03,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:03,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:03,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665187890] [2024-11-16 18:36:03,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665187890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:03,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:03,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:36:03,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394613864] [2024-11-16 18:36:03,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:03,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:36:03,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:03,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:36:03,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:36:03,213 INFO L87 Difference]: Start difference. First operand 300 states and 425 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:04,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:36:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:04,340 INFO L93 Difference]: Finished difference Result 535 states and 759 transitions. [2024-11-16 18:36:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:36:04,341 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-16 18:36:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:04,344 INFO L225 Difference]: With dead ends: 535 [2024-11-16 18:36:04,344 INFO L226 Difference]: Without dead ends: 306 [2024-11-16 18:36:04,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-16 18:36:04,346 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:04,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 18:36:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-16 18:36:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-16 18:36:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 266 states have (on average 1.349624060150376) internal successors, (359), 266 states have internal predecessors, (359), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:36:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 431 transitions. [2024-11-16 18:36:04,365 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 431 transitions. Word has length 117 [2024-11-16 18:36:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:04,366 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 431 transitions. [2024-11-16 18:36:04,366 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 431 transitions. [2024-11-16 18:36:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 18:36:04,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:04,369 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:04,381 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 (8)] Ended with exit code 0 [2024-11-16 18:36:04,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-16 18:36:04,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:04,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1246491883, now seen corresponding path program 1 times [2024-11-16 18:36:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:04,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792859894] [2024-11-16 18:36:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:04,571 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-16 18:36:04,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:04,572 INFO L229 MonitoredProcess]: Starting monitored process 9 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-16 18:36:04,573 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 (9)] Waiting until timeout for monitored process [2024-11-16 18:36:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:04,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:36:04,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-16 18:36:05,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:36:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:05,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:05,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792859894] [2024-11-16 18:36:05,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792859894] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:36:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:36:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-16 18:36:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611895106] [2024-11-16 18:36:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:05,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:36:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:36:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:36:05,596 INFO L87 Difference]: Start difference. First operand 306 states and 431 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:05,739 INFO L93 Difference]: Finished difference Result 577 states and 805 transitions. [2024-11-16 18:36:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:36:05,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-16 18:36:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:05,743 INFO L225 Difference]: With dead ends: 577 [2024-11-16 18:36:05,743 INFO L226 Difference]: Without dead ends: 342 [2024-11-16 18:36:05,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:36:05,744 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 80 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:05,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 422 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:36:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-16 18:36:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 291. [2024-11-16 18:36:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 251 states have (on average 1.3227091633466135) internal successors, (332), 251 states have internal predecessors, (332), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:36:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 404 transitions. [2024-11-16 18:36:05,767 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 404 transitions. Word has length 118 [2024-11-16 18:36:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:05,768 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 404 transitions. [2024-11-16 18:36:05,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 404 transitions. [2024-11-16 18:36:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:36:05,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:05,769 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:05,785 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 (9)] Ended with exit code 0 [2024-11-16 18:36:05,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-16 18:36:05,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:05,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2027170649, now seen corresponding path program 1 times [2024-11-16 18:36:05,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:05,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969300461] [2024-11-16 18:36:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:05,972 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-16 18:36:05,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:05,973 INFO L229 MonitoredProcess]: Starting monitored process 10 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-16 18:36:05,975 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 (10)] Waiting until timeout for monitored process [2024-11-16 18:36:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:06,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:36:06,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:06,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:06,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:06,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969300461] [2024-11-16 18:36:06,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969300461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:06,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:06,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:36:06,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706497626] [2024-11-16 18:36:06,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:06,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:36:06,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:06,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:36:06,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:36:06,939 INFO L87 Difference]: Start difference. First operand 291 states and 404 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:07,194 INFO L93 Difference]: Finished difference Result 547 states and 756 transitions. [2024-11-16 18:36:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:36:07,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-16 18:36:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:07,197 INFO L225 Difference]: With dead ends: 547 [2024-11-16 18:36:07,197 INFO L226 Difference]: Without dead ends: 327 [2024-11-16 18:36:07,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:36:07,198 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 167 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:07,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 579 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:36:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-16 18:36:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 288. [2024-11-16 18:36:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 248 states have (on average 1.310483870967742) internal successors, (325), 248 states have internal predecessors, (325), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:36:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 397 transitions. [2024-11-16 18:36:07,213 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 397 transitions. Word has length 120 [2024-11-16 18:36:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:07,214 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 397 transitions. [2024-11-16 18:36:07,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 397 transitions. [2024-11-16 18:36:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:36:07,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:07,216 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:07,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-16 18:36:07,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-16 18:36:07,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:07,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1270724294, now seen corresponding path program 1 times [2024-11-16 18:36:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:07,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552236791] [2024-11-16 18:36:07,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:07,417 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-16 18:36:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:07,419 INFO L229 MonitoredProcess]: Starting monitored process 11 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-16 18:36:07,419 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 (11)] Waiting until timeout for monitored process [2024-11-16 18:36:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:07,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:36:07,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:07,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:07,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:07,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552236791] [2024-11-16 18:36:07,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552236791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:07,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:36:07,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222812537] [2024-11-16 18:36:07,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:07,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:36:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:07,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:36:07,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:36:07,998 INFO L87 Difference]: Start difference. First operand 288 states and 397 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:08,057 INFO L93 Difference]: Finished difference Result 508 states and 701 transitions. [2024-11-16 18:36:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:36:08,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-16 18:36:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:08,059 INFO L225 Difference]: With dead ends: 508 [2024-11-16 18:36:08,059 INFO L226 Difference]: Without dead ends: 291 [2024-11-16 18:36:08,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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-16 18:36:08,061 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:08,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:36:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-16 18:36:08,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-16 18:36:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 251 states have (on average 1.302788844621514) internal successors, (327), 251 states have internal predecessors, (327), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:36:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 399 transitions. [2024-11-16 18:36:08,074 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 399 transitions. Word has length 120 [2024-11-16 18:36:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:08,075 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 399 transitions. [2024-11-16 18:36:08,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 399 transitions. [2024-11-16 18:36:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 18:36:08,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:08,076 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:08,095 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 (11)] Ended with exit code 0 [2024-11-16 18:36:08,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-16 18:36:08,280 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:08,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2077471702, now seen corresponding path program 1 times [2024-11-16 18:36:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389254826] [2024-11-16 18:36:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:08,281 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-16 18:36:08,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:08,282 INFO L229 MonitoredProcess]: Starting monitored process 12 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-16 18:36:08,283 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 (12)] Waiting until timeout for monitored process [2024-11-16 18:36:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:08,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:36:08,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:08,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:36:08,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-16 18:36:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-16 18:36:08,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:08,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:08,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389254826] [2024-11-16 18:36:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389254826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:08,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:08,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:36:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955156396] [2024-11-16 18:36:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:08,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:36:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:36:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:36:08,860 INFO L87 Difference]: Start difference. First operand 291 states and 399 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:36:11,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:36:15,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:36:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:15,426 INFO L93 Difference]: Finished difference Result 566 states and 775 transitions. [2024-11-16 18:36:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:36:15,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-16 18:36:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:15,437 INFO L225 Difference]: With dead ends: 566 [2024-11-16 18:36:15,437 INFO L226 Difference]: Without dead ends: 294 [2024-11-16 18:36:15,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:36:15,439 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 118 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:15,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 432 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-16 18:36:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-16 18:36:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2024-11-16 18:36:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 251 states have (on average 1.2908366533864541) internal successors, (324), 251 states have internal predecessors, (324), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:36:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 396 transitions. [2024-11-16 18:36:15,455 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 396 transitions. Word has length 120 [2024-11-16 18:36:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:15,455 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 396 transitions. [2024-11-16 18:36:15,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:36:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 396 transitions. [2024-11-16 18:36:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 18:36:15,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:15,457 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:15,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-16 18:36:15,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-16 18:36:15,658 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:15,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash 470541560, now seen corresponding path program 1 times [2024-11-16 18:36:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662175605] [2024-11-16 18:36:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:15,660 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-16 18:36:15,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:15,663 INFO L229 MonitoredProcess]: Starting monitored process 13 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-16 18:36:15,664 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 (13)] Waiting until timeout for monitored process [2024-11-16 18:36:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:16,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:36:16,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:16,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:36:16,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-16 18:36:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-16 18:36:16,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:16,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:16,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662175605] [2024-11-16 18:36:16,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662175605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:16,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:16,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:36:16,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598439513] [2024-11-16 18:36:16,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:16,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:36:16,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:16,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:36:16,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:36:16,368 INFO L87 Difference]: Start difference. First operand 291 states and 396 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:36:19,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:36:22,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:36:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:22,823 INFO L93 Difference]: Finished difference Result 559 states and 759 transitions. [2024-11-16 18:36:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:36:22,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-16 18:36:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:22,833 INFO L225 Difference]: With dead ends: 559 [2024-11-16 18:36:22,833 INFO L226 Difference]: Without dead ends: 294 [2024-11-16 18:36:22,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:36:22,834 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 109 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:22,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 428 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-16 18:36:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-16 18:36:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2024-11-16 18:36:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 251 states have (on average 1.2788844621513944) internal successors, (321), 251 states have internal predecessors, (321), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:36:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 393 transitions. [2024-11-16 18:36:22,848 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 393 transitions. Word has length 122 [2024-11-16 18:36:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:22,849 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 393 transitions. [2024-11-16 18:36:22,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:36:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 393 transitions. [2024-11-16 18:36:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 18:36:22,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:22,850 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:22,865 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 (13)] Ended with exit code 0 [2024-11-16 18:36:23,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-16 18:36:23,051 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:23,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:23,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2020416086, now seen corresponding path program 1 times [2024-11-16 18:36:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:23,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404413089] [2024-11-16 18:36:23,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:23,052 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-16 18:36:23,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:23,055 INFO L229 MonitoredProcess]: Starting monitored process 14 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-16 18:36:23,056 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 (14)] Waiting until timeout for monitored process [2024-11-16 18:36:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:23,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:36:23,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:23,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:36:23,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-16 18:36:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:36:23,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:23,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:23,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404413089] [2024-11-16 18:36:23,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404413089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:23,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:23,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:36:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970250314] [2024-11-16 18:36:23,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:23,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:36:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:36:23,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:36:23,706 INFO L87 Difference]: Start difference. First operand 291 states and 393 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:36:26,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:36:27,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:36:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:28,195 INFO L93 Difference]: Finished difference Result 552 states and 743 transitions. [2024-11-16 18:36:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:36:28,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2024-11-16 18:36:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:28,202 INFO L225 Difference]: With dead ends: 552 [2024-11-16 18:36:28,203 INFO L226 Difference]: Without dead ends: 294 [2024-11-16 18:36:28,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:36:28,204 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:28,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 424 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-16 18:36:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-16 18:36:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2024-11-16 18:36:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 251 states have (on average 1.2669322709163346) internal successors, (318), 251 states have internal predecessors, (318), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:36:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 390 transitions. [2024-11-16 18:36:28,217 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 390 transitions. Word has length 124 [2024-11-16 18:36:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:28,217 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 390 transitions. [2024-11-16 18:36:28,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:36:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 390 transitions. [2024-11-16 18:36:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 18:36:28,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:28,219 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:28,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-16 18:36:28,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-16 18:36:28,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:28,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1418789240, now seen corresponding path program 1 times [2024-11-16 18:36:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:28,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543423772] [2024-11-16 18:36:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:28,421 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-16 18:36:28,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:28,422 INFO L229 MonitoredProcess]: Starting monitored process 15 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-16 18:36:28,423 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 (15)] Waiting until timeout for monitored process [2024-11-16 18:36:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:28,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:36:28,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:29,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:36:29,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-16 18:36:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-16 18:36:29,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:29,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:29,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543423772] [2024-11-16 18:36:29,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543423772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:29,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:29,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:36:29,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348979485] [2024-11-16 18:36:29,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:29,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:36:29,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:29,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:36:29,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:36:29,209 INFO L87 Difference]: Start difference. First operand 291 states and 390 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:36:32,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:36:33,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:36:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:33,888 INFO L93 Difference]: Finished difference Result 545 states and 727 transitions. [2024-11-16 18:36:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:36:33,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-16 18:36:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:33,896 INFO L225 Difference]: With dead ends: 545 [2024-11-16 18:36:33,896 INFO L226 Difference]: Without dead ends: 294 [2024-11-16 18:36:33,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:36:33,897 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 90 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:33,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 417 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-16 18:36:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-16 18:36:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2024-11-16 18:36:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 251 states have (on average 1.254980079681275) internal successors, (315), 251 states have internal predecessors, (315), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:36:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 387 transitions. [2024-11-16 18:36:33,909 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 387 transitions. Word has length 126 [2024-11-16 18:36:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:33,910 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 387 transitions. [2024-11-16 18:36:33,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:36:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 387 transitions. [2024-11-16 18:36:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 18:36:33,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:33,912 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:33,927 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 (15)] Ended with exit code 0 [2024-11-16 18:36:34,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-16 18:36:34,113 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:34,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash 223760598, now seen corresponding path program 1 times [2024-11-16 18:36:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:34,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540764876] [2024-11-16 18:36:34,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:34,114 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-16 18:36:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:34,115 INFO L229 MonitoredProcess]: Starting monitored process 16 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-16 18:36:34,116 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 (16)] Waiting until timeout for monitored process [2024-11-16 18:36:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:34,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 18:36:34,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:34,644 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-16 18:36:34,841 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-16 18:36:34,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-16 18:36:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:34,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:34,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:34,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540764876] [2024-11-16 18:36:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540764876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:34,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:34,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:36:34,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95510858] [2024-11-16 18:36:34,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:34,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:36:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:34,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:36:34,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:36:34,905 INFO L87 Difference]: Start difference. First operand 291 states and 387 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:35,800 INFO L93 Difference]: Finished difference Result 727 states and 960 transitions. [2024-11-16 18:36:35,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:36:35,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-16 18:36:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:35,803 INFO L225 Difference]: With dead ends: 727 [2024-11-16 18:36:35,803 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 18:36:35,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:36:35,805 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 319 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:35,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1012 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:36:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 18:36:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 485. [2024-11-16 18:36:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 419 states have (on average 1.2553699284009547) internal successors, (526), 419 states have internal predecessors, (526), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:36:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 646 transitions. [2024-11-16 18:36:35,827 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 646 transitions. Word has length 128 [2024-11-16 18:36:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:35,827 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 646 transitions. [2024-11-16 18:36:35,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 646 transitions. [2024-11-16 18:36:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 18:36:35,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:35,829 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:35,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-16 18:36:36,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-16 18:36:36,030 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:36,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:36,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1979622843, now seen corresponding path program 1 times [2024-11-16 18:36:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:36,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944445358] [2024-11-16 18:36:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:36,032 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-16 18:36:36,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:36,034 INFO L229 MonitoredProcess]: Starting monitored process 17 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-16 18:36:36,035 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 (17)] Waiting until timeout for monitored process [2024-11-16 18:36:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:36,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 18:36:36,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:36,575 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-16 18:36:37,763 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-16 18:36:37,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-16 18:36:37,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 18:36:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 137 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-16 18:36:37,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:36:38,482 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-16 18:36:38,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-16 18:36:38,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:38,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944445358] [2024-11-16 18:36:38,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944445358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:36:38,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [268925199] [2024-11-16 18:36:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:38,677 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:36:38,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:36:38,680 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:36:38,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-16 18:36:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:39,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:36:39,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:39,999 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-16 18:36:40,376 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-16 18:36:40,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-16 18:36:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:40,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [268925199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:40,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:36:40,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-16 18:36:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508809652] [2024-11-16 18:36:40,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:40,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:36:40,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:40,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:36:40,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-11-16 18:36:40,565 INFO L87 Difference]: Start difference. First operand 485 states and 646 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:41,568 INFO L93 Difference]: Finished difference Result 1018 states and 1348 transitions. [2024-11-16 18:36:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:36:41,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-16 18:36:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:41,572 INFO L225 Difference]: With dead ends: 1018 [2024-11-16 18:36:41,572 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 18:36:41,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2024-11-16 18:36:41,573 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 276 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:41,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1019 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:36:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 18:36:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 485. [2024-11-16 18:36:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 419 states have (on average 1.2505966587112172) internal successors, (524), 419 states have internal predecessors, (524), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:36:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 644 transitions. [2024-11-16 18:36:41,604 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 644 transitions. Word has length 129 [2024-11-16 18:36:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:41,604 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 644 transitions. [2024-11-16 18:36:41,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 644 transitions. [2024-11-16 18:36:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 18:36:41,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:41,606 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:41,621 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 (17)] Ended with exit code 0 [2024-11-16 18:36:41,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-16 18:36:42,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 18:36:42,006 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:42,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash -166118584, now seen corresponding path program 1 times [2024-11-16 18:36:42,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:42,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151934450] [2024-11-16 18:36:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:42,008 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-16 18:36:42,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:42,009 INFO L229 MonitoredProcess]: Starting monitored process 19 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-16 18:36:42,010 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 (19)] Waiting until timeout for monitored process [2024-11-16 18:36:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:42,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 18:36:42,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:42,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:42,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:42,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151934450] [2024-11-16 18:36:42,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151934450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:42,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:42,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:36:42,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506068694] [2024-11-16 18:36:42,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:42,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:36:42,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:42,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:36:42,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:36:42,811 INFO L87 Difference]: Start difference. First operand 485 states and 644 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:42,935 INFO L93 Difference]: Finished difference Result 909 states and 1210 transitions. [2024-11-16 18:36:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:36:42,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-16 18:36:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:42,937 INFO L225 Difference]: With dead ends: 909 [2024-11-16 18:36:42,938 INFO L226 Difference]: Without dead ends: 497 [2024-11-16 18:36:42,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 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-16 18:36:42,939 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:42,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:36:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-16 18:36:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 493. [2024-11-16 18:36:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 427 states have (on average 1.2459016393442623) internal successors, (532), 427 states have internal predecessors, (532), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:36:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 652 transitions. [2024-11-16 18:36:42,958 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 652 transitions. Word has length 130 [2024-11-16 18:36:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:42,959 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 652 transitions. [2024-11-16 18:36:42,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 652 transitions. [2024-11-16 18:36:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 18:36:42,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:42,960 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:42,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-16 18:36:43,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-16 18:36:43,161 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:43,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash -362632089, now seen corresponding path program 1 times [2024-11-16 18:36:43,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:43,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094717776] [2024-11-16 18:36:43,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:43,162 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-16 18:36:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:43,163 INFO L229 MonitoredProcess]: Starting monitored process 20 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-16 18:36:43,164 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 (20)] Waiting until timeout for monitored process [2024-11-16 18:36:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:43,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:36:43,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:43,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:43,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094717776] [2024-11-16 18:36:43,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094717776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:43,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:43,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:36:43,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458969069] [2024-11-16 18:36:43,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:43,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:36:43,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:43,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:36:43,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:36:43,913 INFO L87 Difference]: Start difference. First operand 493 states and 652 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:44,021 INFO L93 Difference]: Finished difference Result 925 states and 1226 transitions. [2024-11-16 18:36:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:36:44,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-16 18:36:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:44,025 INFO L225 Difference]: With dead ends: 925 [2024-11-16 18:36:44,025 INFO L226 Difference]: Without dead ends: 505 [2024-11-16 18:36:44,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:36:44,026 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:44,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:36:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-16 18:36:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 501. [2024-11-16 18:36:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 435 states have (on average 1.2413793103448276) internal successors, (540), 435 states have internal predecessors, (540), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:36:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 660 transitions. [2024-11-16 18:36:44,046 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 660 transitions. Word has length 130 [2024-11-16 18:36:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:44,046 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 660 transitions. [2024-11-16 18:36:44,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 660 transitions. [2024-11-16 18:36:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 18:36:44,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:44,048 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:44,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-16 18:36:44,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-16 18:36:44,248 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:44,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1380178246, now seen corresponding path program 1 times [2024-11-16 18:36:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:44,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784616320] [2024-11-16 18:36:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:44,249 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-16 18:36:44,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:44,250 INFO L229 MonitoredProcess]: Starting monitored process 21 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-16 18:36:44,251 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 (21)] Waiting until timeout for monitored process [2024-11-16 18:36:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:44,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 18:36:44,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:45,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:45,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:45,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784616320] [2024-11-16 18:36:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784616320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:45,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:45,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:36:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591721007] [2024-11-16 18:36:45,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:45,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:36:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:36:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:36:45,070 INFO L87 Difference]: Start difference. First operand 501 states and 660 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:45,210 INFO L93 Difference]: Finished difference Result 941 states and 1242 transitions. [2024-11-16 18:36:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:36:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-16 18:36:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:45,213 INFO L225 Difference]: With dead ends: 941 [2024-11-16 18:36:45,214 INFO L226 Difference]: Without dead ends: 513 [2024-11-16 18:36:45,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 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-16 18:36:45,216 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:45,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 625 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:36:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-16 18:36:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 509. [2024-11-16 18:36:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 443 states have (on average 1.237020316027088) internal successors, (548), 443 states have internal predecessors, (548), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:36:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 668 transitions. [2024-11-16 18:36:45,254 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 668 transitions. Word has length 130 [2024-11-16 18:36:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:45,255 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 668 transitions. [2024-11-16 18:36:45,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 668 transitions. [2024-11-16 18:36:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 18:36:45,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:45,256 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:45,282 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 (21)] Ended with exit code 0 [2024-11-16 18:36:45,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-16 18:36:45,457 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1408807397, now seen corresponding path program 1 times [2024-11-16 18:36:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889664102] [2024-11-16 18:36:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:45,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-16 18:36:45,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:45,459 INFO L229 MonitoredProcess]: Starting monitored process 22 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-16 18:36:45,461 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 (22)] Waiting until timeout for monitored process [2024-11-16 18:36:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:46,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 18:36:46,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:46,799 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 20 treesize of output 12 [2024-11-16 18:36:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:36:46,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:36:46,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:46,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889664102] [2024-11-16 18:36:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889664102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:36:46,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:36:46,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:36:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084727352] [2024-11-16 18:36:46,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:36:46,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:36:46,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:36:46,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:36:46,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:36:46,839 INFO L87 Difference]: Start difference. First operand 509 states and 668 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:36:47,297 INFO L93 Difference]: Finished difference Result 840 states and 1107 transitions. [2024-11-16 18:36:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:36:47,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 130 [2024-11-16 18:36:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:36:47,304 INFO L225 Difference]: With dead ends: 840 [2024-11-16 18:36:47,304 INFO L226 Difference]: Without dead ends: 717 [2024-11-16 18:36:47,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:36:47,307 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:36:47,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 560 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:36:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-16 18:36:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2024-11-16 18:36:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 621 states have (on average 1.2399355877616747) internal successors, (770), 621 states have internal predecessors, (770), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-16 18:36:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 938 transitions. [2024-11-16 18:36:47,352 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 938 transitions. Word has length 130 [2024-11-16 18:36:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:36:47,353 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 938 transitions. [2024-11-16 18:36:47,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:36:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 938 transitions. [2024-11-16 18:36:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 18:36:47,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:36:47,354 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:36:47,384 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 (22)] Ended with exit code 0 [2024-11-16 18:36:47,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-16 18:36:47,555 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:36:47,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:36:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash 984650076, now seen corresponding path program 1 times [2024-11-16 18:36:47,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:36:47,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938821747] [2024-11-16 18:36:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:47,556 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-16 18:36:47,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:36:47,560 INFO L229 MonitoredProcess]: Starting monitored process 23 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-16 18:36:47,561 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 (23)] Waiting until timeout for monitored process [2024-11-16 18:36:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:36:48,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 18:36:48,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:36:49,746 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 20 treesize of output 12 [2024-11-16 18:36:49,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 18:36:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 137 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-16 18:36:49,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:36:50,584 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-16 18:36:50,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2024-11-16 18:36:50,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:36:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938821747] [2024-11-16 18:36:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938821747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:36:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1699724446] [2024-11-16 18:36:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:36:50,710 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:36:50,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:36:50,711 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:36:50,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process