./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.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 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:01:36,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:01:36,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:01:36,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:01:36,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:01:36,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:01:36,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:01:36,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:01:36,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:01:36,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:01:36,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:01:36,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:01:36,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:01:36,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:01:36,251 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:01:36,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:01:36,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:01:36,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:01:36,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:01:36,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:01:36,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:01:36,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:01:36,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:01:36,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:01:36,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:01:36,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:01:36,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:01:36,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:01:36,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:01:36,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:01:36,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:01:36,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:01:36,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:01:36,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:01:36,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:01:36,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:01:36,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:01:36,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:01:36,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:01:36,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:01:36,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:01:36,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:01:36,259 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 -> 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 [2024-11-19 01:01:36,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:01:36,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:01:36,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:01:36,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:01:36,547 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:01:36,549 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-88.i [2024-11-19 01:01:37,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:01:38,068 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:01:38,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i [2024-11-19 01:01:38,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ad56b16/e24c18fe59ad4052922794e58b415c91/FLAG73d69a975 [2024-11-19 01:01:38,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ad56b16/e24c18fe59ad4052922794e58b415c91 [2024-11-19 01:01:38,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:01:38,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:01:38,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:01:38,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:01:38,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:01:38,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ddafbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38, skipping insertion in model container [2024-11-19 01:01:38,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:01:38,257 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-88.i[916,929] [2024-11-19 01:01:38,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:01:38,308 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:01:38,318 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-88.i[916,929] [2024-11-19 01:01:38,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:01:38,360 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:01:38,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38 WrapperNode [2024-11-19 01:01:38,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:01:38,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:01:38,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:01:38,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:01:38,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,406 INFO L138 Inliner]: procedures = 29, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 565 [2024-11-19 01:01:38,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:01:38,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:01:38,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:01:38,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:01:38,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,449 INFO L175 MemorySlicer]: Split 134 memory accesses to 17 slices as follows [2, 9, 10, 6, 16, 17, 12, 6, 8, 10, 10, 3, 4, 3, 8, 4, 6]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-11-19 01:01:38,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:01:38,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:01:38,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:01:38,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:01:38,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (1/1) ... [2024-11-19 01:01:38,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:01:38,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:01:38,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:01:38,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:01:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:01:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 01:01:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 01:01:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 01:01:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 01:01:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 01:01:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 01:01:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 01:01:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-19 01:01:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-19 01:01:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-19 01:01:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-19 01:01:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-19 01:01:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-19 01:01:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-19 01:01:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-19 01:01:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-19 01:01:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2024-11-19 01:01:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:01:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:01:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 01:01:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 01:01:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 01:01:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 01:01:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 01:01:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 01:01:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 01:01:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 01:01:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 01:01:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 01:01:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 01:01:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-19 01:01:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-19 01:01:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-19 01:01:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-19 01:01:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 01:01:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 01:01:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 01:01:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 01:01:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 01:01:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 01:01:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 01:01:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:01:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 01:01:38,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 01:01:38,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-19 01:01:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-19 01:01:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-19 01:01:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-19 01:01:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-19 01:01:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-19 01:01:38,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-19 01:01:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-19 01:01:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-19 01:01:38,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2024-11-19 01:01:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:01:38,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:01:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:01:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:01:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 01:01:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 01:01:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 01:01:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 01:01:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 01:01:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 01:01:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 01:01:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 01:01:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 01:01:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 01:01:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 01:01:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 01:01:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-19 01:01:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-19 01:01:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-19 01:01:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:01:38,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:01:38,801 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:01:38,804 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:01:39,289 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-19 01:01:39,292 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:01:39,303 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:01:39,303 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:01:39,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:01:39 BoogieIcfgContainer [2024-11-19 01:01:39,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:01:39,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:01:39,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:01:39,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:01:39,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:01:38" (1/3) ... [2024-11-19 01:01:39,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712b329b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:01:39, skipping insertion in model container [2024-11-19 01:01:39,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:38" (2/3) ... [2024-11-19 01:01:39,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712b329b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:01:39, skipping insertion in model container [2024-11-19 01:01:39,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:01:39" (3/3) ... [2024-11-19 01:01:39,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-88.i [2024-11-19 01:01:39,325 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:01:39,325 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:01:39,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:01:39,384 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;@64e7e2d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:01:39,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:01:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:01:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:01:39,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:39,399 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:39,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:39,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash -977501909, now seen corresponding path program 1 times [2024-11-19 01:01:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:39,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931639510] [2024-11-19 01:01:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-19 01:01:39,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:39,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931639510] [2024-11-19 01:01:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931639510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:01:39,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224814120] [2024-11-19 01:01:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:39,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:01:39,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:01:39,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:01:39,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:01:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:40,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:01:40,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:01:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-19 01:01:40,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:01:40,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224814120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:40,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:01:40,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:01:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339195121] [2024-11-19 01:01:40,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:40,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:01:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:40,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:01:40,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:01:40,153 INFO L87 Difference]: Start difference. First operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:01:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:40,186 INFO L93 Difference]: Finished difference Result 231 states and 361 transitions. [2024-11-19 01:01:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:01:40,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-19 01:01:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:40,197 INFO L225 Difference]: With dead ends: 231 [2024-11-19 01:01:40,197 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 01:01:40,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:01:40,206 INFO L432 NwaCegarLoop]: 168 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, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:40,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 01:01:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-19 01:01:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:01:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-11-19 01:01:40,243 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2024-11-19 01:01:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:40,243 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-11-19 01:01:40,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:01:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-11-19 01:01:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:01:40,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:40,246 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:40,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:01:40,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:01:40,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:40,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash -124153451, now seen corresponding path program 1 times [2024-11-19 01:01:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900865730] [2024-11-19 01:01:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:40,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900865730] [2024-11-19 01:01:40,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900865730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:40,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:40,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:01:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244176314] [2024-11-19 01:01:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:40,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:01:40,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:01:40,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:01:40,758 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:40,793 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2024-11-19 01:01:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:01:40,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-19 01:01:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:40,797 INFO L225 Difference]: With dead ends: 230 [2024-11-19 01:01:40,798 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 01:01:40,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 01:01:40,800 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:40,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 484 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 01:01:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-19 01:01:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:01:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-19 01:01:40,810 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2024-11-19 01:01:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:40,812 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-19 01:01:40,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-19 01:01:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:01:40,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:40,817 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:40,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:01:40,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:40,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash 555904919, now seen corresponding path program 1 times [2024-11-19 01:01:40,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:40,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51342411] [2024-11-19 01:01:40,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:40,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:41,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:41,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51342411] [2024-11-19 01:01:41,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51342411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:41,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:41,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:01:41,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916936705] [2024-11-19 01:01:41,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:41,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:01:41,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:41,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:01:41,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:01:41,039 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:41,076 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2024-11-19 01:01:41,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:01:41,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-19 01:01:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:41,082 INFO L225 Difference]: With dead ends: 234 [2024-11-19 01:01:41,082 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 01:01:41,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 01:01:41,084 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:41,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 485 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 01:01:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-19 01:01:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:01:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-19 01:01:41,105 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2024-11-19 01:01:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:41,107 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-19 01:01:41,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-19 01:01:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:01:41,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:41,109 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:41,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:01:41,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:41,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:41,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1964055015, now seen corresponding path program 1 times [2024-11-19 01:01:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:41,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956300030] [2024-11-19 01:01:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:41,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:41,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956300030] [2024-11-19 01:01:41,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956300030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:41,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:41,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:01:41,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378590082] [2024-11-19 01:01:41,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:41,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:01:41,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:41,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:01:41,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:01:41,282 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:41,313 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2024-11-19 01:01:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:01:41,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-19 01:01:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:41,316 INFO L225 Difference]: With dead ends: 238 [2024-11-19 01:01:41,316 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 01:01:41,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 01:01:41,321 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:41,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 01:01:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-19 01:01:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:01:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-11-19 01:01:41,343 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2024-11-19 01:01:41,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:41,345 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-11-19 01:01:41,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-11-19 01:01:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:01:41,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:41,349 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:41,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:01:41,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:41,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1962207973, now seen corresponding path program 1 times [2024-11-19 01:01:41,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:41,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329818849] [2024-11-19 01:01:41,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:41,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:41,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:41,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329818849] [2024-11-19 01:01:41,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329818849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:41,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:41,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:01:41,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715461633] [2024-11-19 01:01:41,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:41,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:01:41,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:41,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:01:41,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:01:41,661 INFO L87 Difference]: Start difference. First operand 121 states and 174 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:41,744 INFO L93 Difference]: Finished difference Result 255 states and 365 transitions. [2024-11-19 01:01:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:01:41,745 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-19 01:01:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:41,746 INFO L225 Difference]: With dead ends: 255 [2024-11-19 01:01:41,746 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 01:01:41,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 01:01:41,748 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 93 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:41,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 579 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:01:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 01:01:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-19 01:01:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 113 states have internal predecessors, (150), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 01:01:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2024-11-19 01:01:41,765 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 143 [2024-11-19 01:01:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:41,765 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2024-11-19 01:01:41,765 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2024-11-19 01:01:41,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 01:01:41,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:41,766 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:41,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:01:41,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:41,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:41,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1473446771, now seen corresponding path program 1 times [2024-11-19 01:01:41,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:41,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806321642] [2024-11-19 01:01:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:01:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:42,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806321642] [2024-11-19 01:01:42,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806321642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:01:42,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725040925] [2024-11-19 01:01:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:42,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:01:42,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:01:42,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:01:42,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:01:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:42,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:01:42,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:01:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:42,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:01:42,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725040925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:42,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:01:42,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 01:01:42,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821762218] [2024-11-19 01:01:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:42,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:01:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:01:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:01:42,286 INFO L87 Difference]: Start difference. First operand 136 states and 192 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:42,318 INFO L93 Difference]: Finished difference Result 263 states and 372 transitions. [2024-11-19 01:01:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:01:42,318 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-19 01:01:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:42,320 INFO L225 Difference]: With dead ends: 263 [2024-11-19 01:01:42,320 INFO L226 Difference]: Without dead ends: 139 [2024-11-19 01:01:42,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:01:42,321 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 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-19 01:01:42,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-19 01:01:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-19 01:01:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 116 states have internal predecessors, (153), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 01:01:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 195 transitions. [2024-11-19 01:01:42,333 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 195 transitions. Word has length 145 [2024-11-19 01:01:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:42,334 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 195 transitions. [2024-11-19 01:01:42,334 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2024-11-19 01:01:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 01:01:42,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:42,335 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:42,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:01:42,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 01:01:42,536 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:42,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 836187951, now seen corresponding path program 1 times [2024-11-19 01:01:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:42,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669733535] [2024-11-19 01:01:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:42,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:42,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669733535] [2024-11-19 01:01:42,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669733535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:42,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:42,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:01:42,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061862497] [2024-11-19 01:01:42,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:42,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:01:42,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:42,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:01:42,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:01:42,920 INFO L87 Difference]: Start difference. First operand 139 states and 195 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:42,998 INFO L93 Difference]: Finished difference Result 267 states and 375 transitions. [2024-11-19 01:01:42,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:01:42,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-19 01:01:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:43,000 INFO L225 Difference]: With dead ends: 267 [2024-11-19 01:01:43,000 INFO L226 Difference]: Without dead ends: 140 [2024-11-19 01:01:43,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:01:43,002 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 88 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:43,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 741 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-19 01:01:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-11-19 01:01:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 114 states have internal predecessors, (150), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 01:01:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2024-11-19 01:01:43,011 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 146 [2024-11-19 01:01:43,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:43,011 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2024-11-19 01:01:43,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:43,011 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2024-11-19 01:01:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 01:01:43,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:43,012 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:01:43,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -579006286, now seen corresponding path program 1 times [2024-11-19 01:01:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598132303] [2024-11-19 01:01:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:43,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:43,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598132303] [2024-11-19 01:01:43,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598132303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:43,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:43,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:01:43,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200935241] [2024-11-19 01:01:43,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:43,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:01:43,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:43,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:01:43,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:01:43,389 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:43,517 INFO L93 Difference]: Finished difference Result 375 states and 529 transitions. [2024-11-19 01:01:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:01:43,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-19 01:01:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:43,519 INFO L225 Difference]: With dead ends: 375 [2024-11-19 01:01:43,519 INFO L226 Difference]: Without dead ends: 250 [2024-11-19 01:01:43,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:01:43,520 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 160 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:43,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 466 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:01:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-19 01:01:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 200. [2024-11-19 01:01:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 162 states have internal predecessors, (214), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:01:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 282 transitions. [2024-11-19 01:01:43,534 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 282 transitions. Word has length 147 [2024-11-19 01:01:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:43,535 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 282 transitions. [2024-11-19 01:01:43,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 282 transitions. [2024-11-19 01:01:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 01:01:43,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:43,536 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:43,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:01:43,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:43,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:43,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1033428596, now seen corresponding path program 1 times [2024-11-19 01:01:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:43,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845768352] [2024-11-19 01:01:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:43,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845768352] [2024-11-19 01:01:43,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845768352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:43,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:43,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:01:43,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302041438] [2024-11-19 01:01:43,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:43,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:01:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:43,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:01:43,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:01:43,894 INFO L87 Difference]: Start difference. First operand 200 states and 282 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:44,107 INFO L93 Difference]: Finished difference Result 396 states and 557 transitions. [2024-11-19 01:01:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:01:44,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-19 01:01:44,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:44,109 INFO L225 Difference]: With dead ends: 396 [2024-11-19 01:01:44,110 INFO L226 Difference]: Without dead ends: 250 [2024-11-19 01:01:44,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:01:44,111 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 155 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:44,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 824 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:01:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-19 01:01:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 200. [2024-11-19 01:01:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 162 states have internal predecessors, (213), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:01:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 281 transitions. [2024-11-19 01:01:44,126 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 281 transitions. Word has length 151 [2024-11-19 01:01:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:44,126 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 281 transitions. [2024-11-19 01:01:44,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 281 transitions. [2024-11-19 01:01:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 01:01:44,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:44,128 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:44,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:01:44,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:44,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash -639061810, now seen corresponding path program 1 times [2024-11-19 01:01:44,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:44,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115353654] [2024-11-19 01:01:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:44,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:44,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:44,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115353654] [2024-11-19 01:01:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115353654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:01:44,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727421789] [2024-11-19 01:01:44,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:44,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:01:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:44,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:01:44,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:01:44,470 INFO L87 Difference]: Start difference. First operand 200 states and 281 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:44,522 INFO L93 Difference]: Finished difference Result 408 states and 574 transitions. [2024-11-19 01:01:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:01:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-19 01:01:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:44,524 INFO L225 Difference]: With dead ends: 408 [2024-11-19 01:01:44,524 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 01:01:44,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:01:44,525 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 625 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-19 01:01:44,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 625 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 01:01:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 247. [2024-11-19 01:01:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 209 states have (on average 1.354066985645933) internal successors, (283), 209 states have internal predecessors, (283), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:01:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 351 transitions. [2024-11-19 01:01:44,541 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 351 transitions. Word has length 151 [2024-11-19 01:01:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:44,543 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 351 transitions. [2024-11-19 01:01:44,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 351 transitions. [2024-11-19 01:01:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 01:01:44,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:44,545 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:44,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:01:44,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:44,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1368748281, now seen corresponding path program 1 times [2024-11-19 01:01:44,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:44,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560976825] [2024-11-19 01:01:44,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:44,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:45,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:45,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560976825] [2024-11-19 01:01:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560976825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:45,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:45,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:01:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070028300] [2024-11-19 01:01:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:45,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:01:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:45,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:01:45,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:01:45,141 INFO L87 Difference]: Start difference. First operand 247 states and 351 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:45,233 INFO L93 Difference]: Finished difference Result 501 states and 703 transitions. [2024-11-19 01:01:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:01:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-19 01:01:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:45,236 INFO L225 Difference]: With dead ends: 501 [2024-11-19 01:01:45,236 INFO L226 Difference]: Without dead ends: 347 [2024-11-19 01:01:45,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:01:45,236 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 79 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:45,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 890 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:01:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-19 01:01:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2024-11-19 01:01:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 296 states have (on average 1.337837837837838) internal successors, (396), 297 states have internal predecessors, (396), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 01:01:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 480 transitions. [2024-11-19 01:01:45,257 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 480 transitions. Word has length 152 [2024-11-19 01:01:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:45,258 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 480 transitions. [2024-11-19 01:01:45,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 480 transitions. [2024-11-19 01:01:45,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 01:01:45,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:45,260 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:45,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:01:45,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:45,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash 469957576, now seen corresponding path program 1 times [2024-11-19 01:01:45,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:45,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427285664] [2024-11-19 01:01:45,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:45,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:45,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:45,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427285664] [2024-11-19 01:01:45,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427285664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:45,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:45,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:01:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036752213] [2024-11-19 01:01:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:45,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:01:45,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:45,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:01:45,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:01:45,523 INFO L87 Difference]: Start difference. First operand 344 states and 480 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:45,577 INFO L93 Difference]: Finished difference Result 730 states and 1017 transitions. [2024-11-19 01:01:45,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:01:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2024-11-19 01:01:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:45,581 INFO L225 Difference]: With dead ends: 730 [2024-11-19 01:01:45,581 INFO L226 Difference]: Without dead ends: 468 [2024-11-19 01:01:45,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:01:45,582 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 174 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:45,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 624 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-19 01:01:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 346. [2024-11-19 01:01:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 298 states have (on average 1.332214765100671) internal successors, (397), 299 states have internal predecessors, (397), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 01:01:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 481 transitions. [2024-11-19 01:01:45,598 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 481 transitions. Word has length 153 [2024-11-19 01:01:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:45,598 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 481 transitions. [2024-11-19 01:01:45,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 481 transitions. [2024-11-19 01:01:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-19 01:01:45,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:45,600 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:45,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:01:45,600 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:45,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:45,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1448215884, now seen corresponding path program 1 times [2024-11-19 01:01:45,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:45,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715457668] [2024-11-19 01:01:45,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:45,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:45,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715457668] [2024-11-19 01:01:45,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715457668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:45,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:45,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:01:45,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698760782] [2024-11-19 01:01:45,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:45,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:01:45,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:45,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:01:45,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:01:45,675 INFO L87 Difference]: Start difference. First operand 346 states and 481 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:45,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:45,698 INFO L93 Difference]: Finished difference Result 607 states and 846 transitions. [2024-11-19 01:01:45,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:01:45,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2024-11-19 01:01:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:45,700 INFO L225 Difference]: With dead ends: 607 [2024-11-19 01:01:45,700 INFO L226 Difference]: Without dead ends: 350 [2024-11-19 01:01:45,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 01:01:45,702 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:45,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-19 01:01:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-11-19 01:01:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 302 states have (on average 1.3278145695364238) internal successors, (401), 303 states have internal predecessors, (401), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 01:01:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 485 transitions. [2024-11-19 01:01:45,721 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 485 transitions. Word has length 154 [2024-11-19 01:01:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:45,721 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 485 transitions. [2024-11-19 01:01:45,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 485 transitions. [2024-11-19 01:01:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-19 01:01:45,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:45,722 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:45,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 01:01:45,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:45,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:45,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1269140613, now seen corresponding path program 1 times [2024-11-19 01:01:45,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:45,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088550569] [2024-11-19 01:01:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:45,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:46,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:46,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088550569] [2024-11-19 01:01:46,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088550569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:46,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:46,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:01:46,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126601766] [2024-11-19 01:01:46,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:46,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:01:46,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:46,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:01:46,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:01:46,216 INFO L87 Difference]: Start difference. First operand 350 states and 485 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:46,293 INFO L93 Difference]: Finished difference Result 362 states and 497 transitions. [2024-11-19 01:01:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:01:46,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2024-11-19 01:01:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:46,296 INFO L225 Difference]: With dead ends: 362 [2024-11-19 01:01:46,296 INFO L226 Difference]: Without dead ends: 360 [2024-11-19 01:01:46,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:01:46,297 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 105 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:46,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 960 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-19 01:01:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-11-19 01:01:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 311 states have (on average 1.3183279742765273) internal successors, (410), 312 states have internal predecessors, (410), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 01:01:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 494 transitions. [2024-11-19 01:01:46,322 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 494 transitions. Word has length 154 [2024-11-19 01:01:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:46,322 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 494 transitions. [2024-11-19 01:01:46,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 494 transitions. [2024-11-19 01:01:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-19 01:01:46,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:46,324 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:46,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 01:01:46,324 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:46,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1270987655, now seen corresponding path program 1 times [2024-11-19 01:01:46,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:46,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544294926] [2024-11-19 01:01:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:01:46,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:46,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544294926] [2024-11-19 01:01:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544294926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:01:46,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125814621] [2024-11-19 01:01:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:46,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:01:46,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:01:46,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:01:46,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:01:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:47,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-19 01:01:47,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:01:47,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 01:01:48,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 01:01:49,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-19 01:01:49,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 01:01:49,760 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-19 01:01:49,883 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-19 01:01:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 11 proven. 409 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 01:01:49,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:01:50,609 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 44 [2024-11-19 01:01:51,064 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 36 treesize of output 32 [2024-11-19 01:01:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-19 01:01:51,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125814621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:01:51,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:01:51,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 38 [2024-11-19 01:01:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350730154] [2024-11-19 01:01:51,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:01:51,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 01:01:51,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:51,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 01:01:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 01:01:51,325 INFO L87 Difference]: Start difference. First operand 360 states and 494 transitions. Second operand has 38 states, 32 states have (on average 6.625) internal successors, (212), 35 states have internal predecessors, (212), 15 states have call successors, (51), 6 states have call predecessors, (51), 9 states have return successors, (51), 10 states have call predecessors, (51), 15 states have call successors, (51) [2024-11-19 01:01:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:53,154 INFO L93 Difference]: Finished difference Result 958 states and 1289 transitions. [2024-11-19 01:01:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 01:01:53,154 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 6.625) internal successors, (212), 35 states have internal predecessors, (212), 15 states have call successors, (51), 6 states have call predecessors, (51), 9 states have return successors, (51), 10 states have call predecessors, (51), 15 states have call successors, (51) Word has length 154 [2024-11-19 01:01:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:53,157 INFO L225 Difference]: With dead ends: 958 [2024-11-19 01:01:53,157 INFO L226 Difference]: Without dead ends: 685 [2024-11-19 01:01:53,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=851, Invalid=2931, Unknown=0, NotChecked=0, Total=3782 [2024-11-19 01:01:53,159 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 863 mSDsluCounter, 2272 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:53,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2407 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 01:01:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-19 01:01:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 655. [2024-11-19 01:01:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 569 states have (on average 1.3057996485061512) internal successors, (743), 571 states have internal predecessors, (743), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:01:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 877 transitions. [2024-11-19 01:01:53,189 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 877 transitions. Word has length 154 [2024-11-19 01:01:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:53,189 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 877 transitions. [2024-11-19 01:01:53,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 6.625) internal successors, (212), 35 states have internal predecessors, (212), 15 states have call successors, (51), 6 states have call predecessors, (51), 9 states have return successors, (51), 10 states have call predecessors, (51), 15 states have call successors, (51) [2024-11-19 01:01:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 877 transitions. [2024-11-19 01:01:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 01:01:53,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:53,191 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:53,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 01:01:53,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:01:53,391 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:53,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash -454099741, now seen corresponding path program 1 times [2024-11-19 01:01:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667620402] [2024-11-19 01:01:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:53,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:53,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667620402] [2024-11-19 01:01:53,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667620402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:53,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:53,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:01:53,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659357669] [2024-11-19 01:01:53,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:53,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:01:53,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:53,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:01:53,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:01:53,639 INFO L87 Difference]: Start difference. First operand 655 states and 877 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:53,713 INFO L93 Difference]: Finished difference Result 1045 states and 1412 transitions. [2024-11-19 01:01:53,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:01:53,714 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-19 01:01:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:53,720 INFO L225 Difference]: With dead ends: 1045 [2024-11-19 01:01:53,720 INFO L226 Difference]: Without dead ends: 786 [2024-11-19 01:01:53,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:01:53,721 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 74 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:53,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 746 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-19 01:01:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 683. [2024-11-19 01:01:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 597 states have (on average 1.3132328308207706) internal successors, (784), 599 states have internal predecessors, (784), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:01:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 918 transitions. [2024-11-19 01:01:53,755 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 918 transitions. Word has length 155 [2024-11-19 01:01:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:53,756 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 918 transitions. [2024-11-19 01:01:53,756 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 918 transitions. [2024-11-19 01:01:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 01:01:53,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:53,757 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:53,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 01:01:53,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:53,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash -235245023, now seen corresponding path program 1 times [2024-11-19 01:01:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472412201] [2024-11-19 01:01:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:54,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:54,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472412201] [2024-11-19 01:01:54,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472412201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:54,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:54,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:01:54,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887010156] [2024-11-19 01:01:54,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:54,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:01:54,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:01:54,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:01:54,032 INFO L87 Difference]: Start difference. First operand 683 states and 918 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:54,182 INFO L93 Difference]: Finished difference Result 1457 states and 1957 transitions. [2024-11-19 01:01:54,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:01:54,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-19 01:01:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:54,186 INFO L225 Difference]: With dead ends: 1457 [2024-11-19 01:01:54,187 INFO L226 Difference]: Without dead ends: 905 [2024-11-19 01:01:54,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:01:54,190 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 154 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:54,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 929 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:01:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-19 01:01:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 701. [2024-11-19 01:01:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 615 states have (on average 1.3040650406504064) internal successors, (802), 617 states have internal predecessors, (802), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:01:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 936 transitions. [2024-11-19 01:01:54,223 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 936 transitions. Word has length 155 [2024-11-19 01:01:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:54,223 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 936 transitions. [2024-11-19 01:01:54,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 936 transitions. [2024-11-19 01:01:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 01:01:54,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:54,224 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:54,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 01:01:54,225 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:54,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:54,225 INFO L85 PathProgramCache]: Analyzing trace with hash 517266725, now seen corresponding path program 1 times [2024-11-19 01:01:54,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:54,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907513352] [2024-11-19 01:01:54,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:54,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:54,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:54,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907513352] [2024-11-19 01:01:54,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907513352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:54,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:54,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:01:54,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102988080] [2024-11-19 01:01:54,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:54,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:01:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:54,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:01:54,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:01:54,291 INFO L87 Difference]: Start difference. First operand 701 states and 936 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:54,325 INFO L93 Difference]: Finished difference Result 1257 states and 1692 transitions. [2024-11-19 01:01:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:01:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-11-19 01:01:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:54,329 INFO L225 Difference]: With dead ends: 1257 [2024-11-19 01:01:54,329 INFO L226 Difference]: Without dead ends: 705 [2024-11-19 01:01:54,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 01:01:54,331 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:54,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:54,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-19 01:01:54,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-11-19 01:01:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 619 states have (on average 1.3021001615508885) internal successors, (806), 621 states have internal predecessors, (806), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:01:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 940 transitions. [2024-11-19 01:01:54,361 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 940 transitions. Word has length 156 [2024-11-19 01:01:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:54,361 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 940 transitions. [2024-11-19 01:01:54,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 940 transitions. [2024-11-19 01:01:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-19 01:01:54,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:54,363 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:54,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 01:01:54,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:54,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1311898124, now seen corresponding path program 1 times [2024-11-19 01:01:54,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:54,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304298037] [2024-11-19 01:01:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:54,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:54,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:54,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304298037] [2024-11-19 01:01:54,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304298037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:54,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:54,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:01:54,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192365728] [2024-11-19 01:01:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:54,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:01:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:54,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:01:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:01:54,610 INFO L87 Difference]: Start difference. First operand 705 states and 940 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:54,685 INFO L93 Difference]: Finished difference Result 1152 states and 1537 transitions. [2024-11-19 01:01:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:01:54,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-11-19 01:01:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:54,690 INFO L225 Difference]: With dead ends: 1152 [2024-11-19 01:01:54,690 INFO L226 Difference]: Without dead ends: 837 [2024-11-19 01:01:54,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:01:54,692 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 158 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 476 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.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:54,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 476 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:01:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-11-19 01:01:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 677. [2024-11-19 01:01:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 591 states have (on average 1.2978003384094754) internal successors, (767), 593 states have internal predecessors, (767), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:01:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 901 transitions. [2024-11-19 01:01:54,737 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 901 transitions. Word has length 156 [2024-11-19 01:01:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:54,738 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 901 transitions. [2024-11-19 01:01:54,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 901 transitions. [2024-11-19 01:01:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 01:01:54,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:54,741 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:54,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 01:01:54,741 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:54,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1669449214, now seen corresponding path program 1 times [2024-11-19 01:01:54,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:54,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509040792] [2024-11-19 01:01:54,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:54,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:01:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:01:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:01:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509040792] [2024-11-19 01:01:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509040792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:01:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:01:55,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:01:55,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39916769] [2024-11-19 01:01:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:01:55,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:01:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:01:55,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:01:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:01:55,136 INFO L87 Difference]: Start difference. First operand 677 states and 901 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:01:55,477 INFO L93 Difference]: Finished difference Result 1532 states and 2043 transitions. [2024-11-19 01:01:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:01:55,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2024-11-19 01:01:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:01:55,481 INFO L225 Difference]: With dead ends: 1532 [2024-11-19 01:01:55,481 INFO L226 Difference]: Without dead ends: 978 [2024-11-19 01:01:55,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:01:55,482 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 324 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:01:55,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1003 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:01:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-19 01:01:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 917. [2024-11-19 01:01:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 799 states have (on average 1.2866082603254068) internal successors, (1028), 803 states have internal predecessors, (1028), 92 states have call successors, (92), 25 states have call predecessors, (92), 25 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-19 01:01:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1212 transitions. [2024-11-19 01:01:55,521 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1212 transitions. Word has length 158 [2024-11-19 01:01:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:01:55,521 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1212 transitions. [2024-11-19 01:01:55,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:01:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1212 transitions. [2024-11-19 01:01:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-19 01:01:55,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:01:55,523 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:55,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 01:01:55,523 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:01:55,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:01:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash -396140399, now seen corresponding path program 1 times [2024-11-19 01:01:55,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:01:55,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987581276] [2024-11-19 01:01:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:01:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:01:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:01:55,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:01:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:01:55,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:01:55,784 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:01:55,785 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:01:55,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 01:01:55,790 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:01:55,972 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:01:55,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:01:55 BoogieIcfgContainer [2024-11-19 01:01:55,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:01:55,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:01:55,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:01:55,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:01:55,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:01:39" (3/4) ... [2024-11-19 01:01:55,981 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:01:55,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:01:55,987 INFO L158 Benchmark]: Toolchain (without parser) took 17887.66ms. Allocated memory was 163.6MB in the beginning and 585.1MB in the end (delta: 421.5MB). Free memory was 122.8MB in the beginning and 291.5MB in the end (delta: -168.7MB). Peak memory consumption was 255.5MB. Max. memory is 16.1GB. [2024-11-19 01:01:55,987 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:01:55,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.77ms. Allocated memory is still 163.6MB. Free memory was 122.8MB in the beginning and 106.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 01:01:55,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.82ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 103.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:01:55,987 INFO L158 Benchmark]: Boogie Preprocessor took 80.40ms. Allocated memory is still 163.6MB. Free memory was 103.0MB in the beginning and 96.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 01:01:55,987 INFO L158 Benchmark]: RCFGBuilder took 815.68ms. Allocated memory is still 163.6MB. Free memory was 96.7MB in the beginning and 119.9MB in the end (delta: -23.2MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-11-19 01:01:55,987 INFO L158 Benchmark]: TraceAbstraction took 16672.83ms. Allocated memory was 163.6MB in the beginning and 585.1MB in the end (delta: 421.5MB). Free memory was 119.9MB in the beginning and 291.5MB in the end (delta: -171.6MB). Peak memory consumption was 250.5MB. Max. memory is 16.1GB. [2024-11-19 01:01:55,988 INFO L158 Benchmark]: Witness Printer took 7.61ms. Allocated memory is still 585.1MB. Free memory is still 291.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:01:55,989 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.77ms. Allocated memory is still 163.6MB. Free memory was 122.8MB in the beginning and 106.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.82ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 103.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.40ms. Allocated memory is still 163.6MB. Free memory was 103.0MB in the beginning and 96.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 815.68ms. Allocated memory is still 163.6MB. Free memory was 96.7MB in the beginning and 119.9MB in the end (delta: -23.2MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16672.83ms. Allocated memory was 163.6MB in the beginning and 585.1MB in the end (delta: 421.5MB). Free memory was 119.9MB in the beginning and 291.5MB in the end (delta: -171.6MB). Peak memory consumption was 250.5MB. Max. memory is 16.1GB. * Witness Printer took 7.61ms. Allocated memory is still 585.1MB. Free memory is still 291.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of bitwiseOr at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L22] signed char var_1_1 = -8; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_5 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char* var_1_5_Pointer = &(var_1_5); [L26] unsigned char var_1_6 = 1; [L26] unsigned char var_1_6 = 1; [L27] unsigned char* var_1_6_Pointer = &(var_1_6); [L28] signed char var_1_7 = -1; [L28] signed char var_1_7 = -1; [L29] signed char* var_1_7_Pointer = &(var_1_7); [L30] signed char var_1_8 = -50; [L30] signed char var_1_8 = -50; [L31] signed char* var_1_8_Pointer = &(var_1_8); [L32] signed char var_1_9 = 100; [L32] signed char var_1_9 = 100; [L33] signed char* var_1_9_Pointer = &(var_1_9); [L34] unsigned long int var_1_10 = 25; [L34] unsigned long int var_1_10 = 25; [L35] unsigned long int* var_1_10_Pointer = &(var_1_10); [L36] unsigned long int var_1_11 = 2568920345; [L36] unsigned long int var_1_11 = 2568920345; [L37] unsigned long int* var_1_11_Pointer = &(var_1_11); [L38] unsigned long int var_1_12 = 1191097264; [L38] unsigned long int var_1_12 = 1191097264; [L39] unsigned long int* var_1_12_Pointer = &(var_1_12); [L40] unsigned long int var_1_13 = 1801344522; [L40] unsigned long int var_1_13 = 1801344522; [L41] unsigned long int* var_1_13_Pointer = &(var_1_13); [L42] signed long int var_1_14 = 64; [L42] signed long int var_1_14 = 64; [L43] signed long int* var_1_14_Pointer = &(var_1_14); [L44] signed short int var_1_15 = -16; [L44] signed short int var_1_15 = -16; [L45] signed short int* var_1_15_Pointer = &(var_1_15); [L46] float var_1_16 = 1000000.5; [L46] float var_1_16 = 1000000.5; [L47] float* var_1_16_Pointer = &(var_1_16); [L48] float var_1_17 = 4.5; [L48] float var_1_17 = 4.5; [L49] float* var_1_17_Pointer = &(var_1_17); [L50] unsigned char var_1_18 = 0; [L50] unsigned char var_1_18 = 0; [L51] unsigned char* var_1_18_Pointer = &(var_1_18); [L52] unsigned char var_1_19 = 128; [L52] unsigned char var_1_19 = 128; [L53] unsigned char* var_1_19_Pointer = &(var_1_19); [L54] unsigned long int last_1_var_1_10 = 25; [L55] signed short int last_1_var_1_15 = -16; [L56] unsigned char last_1_var_1_18 = 0; VAL [isInitial=0, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] EXPR \read(var_1_10) [L114] last_1_var_1_10 = var_1_10 [L115] EXPR \read(var_1_15) [L115] last_1_var_1_15 = var_1_15 [L116] EXPR \read(var_1_18) [L116] last_1_var_1_18 = var_1_18 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L86] var_1_5 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_5 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] var_1_6 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_6 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] var_1_7 = __VERIFIER_nondet_char() [L93] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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 \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_7 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_9 = __VERIFIER_nondet_char() [L96] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_9 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] var_1_11 = __VERIFIER_nondet_ulong() [L99] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] var_1_12 = __VERIFIER_nondet_ulong() [L102] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] var_1_13 = __VERIFIER_nondet_ulong() [L105] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L105] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L105] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L106] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L106] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L106] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L107] var_1_17 = __VERIFIER_nondet_float() [L108] EXPR \read(var_1_17) [L108] EXPR var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L108] EXPR var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F [L108] EXPR \read(var_1_17) [L108] EXPR var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L108] EXPR (var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L108] EXPR (var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L108] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L108] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L109] var_1_19 = __VERIFIER_nondet_uchar() [L110] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L110] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L110] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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 \read(var_1_19) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L127] RET updateVariables() [L128] CALL step() [L60] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L60] ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L60] ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) [L60] EXPR \read(*var_1_5_Pointer) [L60] ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L60] COND FALSE !(((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) [L67] EXPR \read(*var_1_7_Pointer) [L67] (*(var_1_1_Pointer)) = (*(var_1_7_Pointer)) [L69] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L69] COND FALSE !((*(var_1_5_Pointer))) [L72] EXPR \read(*var_1_12_Pointer) [L72] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L72] COND TRUE (*(var_1_12_Pointer)) <= (*(var_1_8_Pointer)) [L73] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L73] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) [L73] EXPR \read(*var_1_8_Pointer) [L73] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L73] (*(var_1_14_Pointer)) = (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) [L75] (*(var_1_15_Pointer)) = 2 [L76] EXPR \read(*var_1_17_Pointer) [L76] (*(var_1_16_Pointer)) = (*(var_1_17_Pointer)) [L77] EXPR \read(*var_1_19_Pointer) [L77] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L78] EXPR \read(*var_1_8_Pointer) [L78] EXPR \read(*var_1_1_Pointer) [L78] unsigned char stepLocal_0 = (*(var_1_8_Pointer)) < (*(var_1_1_Pointer)); [L79] stepLocal_0 && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L79] stepLocal_0 && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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}] [L79] COND FALSE !(stepLocal_0 && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) [L82] EXPR \read(*var_1_11_Pointer) [L82] EXPR \read(*var_1_13_Pointer) [L82] (*(var_1_10_Pointer)) = ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) [L119] EXPR \read(*var_1_5_Pointer) [L119] EXPR ((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) [L119] EXPR \read(*var_1_1_Pointer) [L119] EXPR \read(*var_1_7_Pointer) [L119] EXPR (((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1) [L119] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1 [L119] EXPR (*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer)))))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer)))))) [L119] EXPR \read(*var_1_8_Pointer) [L119] EXPR \read(*var_1_1_Pointer) [L119] EXPR ((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))) [L119] EXPR \read(*var_1_10_Pointer) [L119] EXPR \read(*var_1_11_Pointer) [L119] EXPR \read(*var_1_13_Pointer) [L119] EXPR (((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer)))))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) [L119] EXPR \read(*var_1_12_Pointer) [L119] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1 [L119] EXPR \read(*var_1_14_Pointer) [L119] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) [L119] EXPR \read(*var_1_8_Pointer) [L119] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2)) [L119] EXPR \read(*var_1_15_Pointer) [L119] EXPR (((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR ((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer)))) [L119] EXPR \read(*var_1_16_Pointer) [L119] EXPR \read(*var_1_17_Pointer) [L119] EXPR ((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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] EXPR (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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-L120] return (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && (*(var_1_5_Pointer))) ? (((*(var_1_5_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed char) (((((*(var_1_7_Pointer))) > ((*(var_1_9_Pointer)))) ? ((*(var_1_7_Pointer))) : ((*(var_1_9_Pointer))))))) : 1)) && ((((*(var_1_8_Pointer)) < (*(var_1_1_Pointer))) && ((((((*(var_1_9_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_8_Pointer))))) == (*(var_1_7_Pointer)))) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))) - 1u)))) : ((*(var_1_10_Pointer)) == ((unsigned long int) ((*(var_1_11_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_14_Pointer)) == ((signed long int) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1)) && ((*(var_1_15_Pointer)) == ((signed short int) 2))) && ((*(var_1_16_Pointer)) == ((float) (*(var_1_17_Pointer))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, 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_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_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, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 21, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2498 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2498 mSDsluCounter, 14186 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10645 mSDsCounter, 385 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2491 IncrementalHoareTripleChecker+Invalid, 2876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 385 mSolverCounterUnsat, 3541 mSDtfsCounter, 2491 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 763 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=917occurred in iteration=20, InterpolantAutomatonStates: 122, 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, 20 MinimizatonAttempts, 826 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 3602 NumberOfCodeBlocks, 3602 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3574 ConstructedInterpolants, 0 QuantifiedInterpolants, 14916 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1965 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 24 InterpolantComputations, 19 PerfectInterpolantSequences, 12501/13056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 01:01:56,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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-88.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 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:01:58,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:01:58,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:01:58,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:01:58,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:01:58,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:01:58,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:01:58,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:01:58,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:01:58,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:01:58,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:01:58,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:01:58,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:01:58,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:01:58,138 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:01:58,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:01:58,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:01:58,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:01:58,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:01:58,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:01:58,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:01:58,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:01:58,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:01:58,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:01:58,145 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:01:58,145 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:01:58,145 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:01:58,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:01:58,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:01:58,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:01:58,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:01:58,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:01:58,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:01:58,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:01:58,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:01:58,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:01:58,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:01:58,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:01:58,149 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:01:58,150 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:01:58,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:01:58,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:01:58,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:01:58,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:01:58,151 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 -> 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 [2024-11-19 01:01:58,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:01:58,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:01:58,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:01:58,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:01:58,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:01:58,461 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-88.i [2024-11-19 01:01:59,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:01:59,930 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:01:59,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i [2024-11-19 01:01:59,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c6285b0/f4d1fb0c570d4bceae291eb488a1b02d/FLAGf0a0de281 [2024-11-19 01:01:59,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c6285b0/f4d1fb0c570d4bceae291eb488a1b02d [2024-11-19 01:01:59,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:01:59,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:01:59,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:01:59,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:01:59,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:01:59,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:01:59" (1/1) ... [2024-11-19 01:01:59,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa18c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:01:59, skipping insertion in model container [2024-11-19 01:01:59,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:01:59" (1/1) ... [2024-11-19 01:01:59,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:02:00,148 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-88.i[916,929] [2024-11-19 01:02:00,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:02:00,258 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:02:00,268 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-88.i[916,929] [2024-11-19 01:02:00,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:02:00,334 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:02:00,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00 WrapperNode [2024-11-19 01:02:00,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:02:00,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:02:00,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:02:00,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:02:00,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,386 INFO L138 Inliner]: procedures = 36, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 545 [2024-11-19 01:02:00,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:02:00,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:02:00,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:02:00,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:02:00,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,436 INFO L175 MemorySlicer]: Split 134 memory accesses to 17 slices as follows [2, 9, 10, 6, 16, 17, 12, 6, 8, 10, 10, 3, 4, 3, 8, 4, 6]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-11-19 01:02:00,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:02:00,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:02:00,488 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:02:00,488 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:02:00,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (1/1) ... [2024-11-19 01:02:00,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:02:00,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:02:00,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:02:00,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:02:00,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:02:00,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:02:00,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:02:00,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 01:02:00,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 01:02:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 01:02:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 01:02:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 01:02:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 01:02:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 01:02:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 01:02:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-19 01:02:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-19 01:02:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-19 01:02:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-19 01:02:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-19 01:02:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-11-19 01:02:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2024-11-19 01:02:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 01:02:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 01:02:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 01:02:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 01:02:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 01:02:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 01:02:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 01:02:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-19 01:02:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-19 01:02:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-19 01:02:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-19 01:02:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-19 01:02:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-19 01:02:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-19 01:02:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-19 01:02:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-11-19 01:02:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2024-11-19 01:02:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:02:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:02:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 01:02:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 01:02:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 01:02:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 01:02:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 01:02:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 01:02:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 01:02:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 01:02:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-19 01:02:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-19 01:02:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-19 01:02:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-19 01:02:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-19 01:02:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-11-19 01:02:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2024-11-19 01:02:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 01:02:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 01:02:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 01:02:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 01:02:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 01:02:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 01:02:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 01:02:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-19 01:02:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-19 01:02:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-19 01:02:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-19 01:02:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-19 01:02:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-19 01:02:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-19 01:02:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-19 01:02:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-11-19 01:02:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2024-11-19 01:02:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:02:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:02:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 01:02:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 01:02:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 01:02:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 01:02:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2024-11-19 01:02:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:02:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:02:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 01:02:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 01:02:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 01:02:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 01:02:00,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-19 01:02:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-19 01:02:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-19 01:02:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-19 01:02:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-19 01:02:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-19 01:02:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-19 01:02:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-19 01:02:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-19 01:02:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-11-19 01:02:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2024-11-19 01:02:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:02:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:02:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 01:02:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 01:02:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 01:02:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 01:02:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-19 01:02:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:02:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 01:02:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 01:02:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 01:02:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 01:02:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-19 01:02:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-19 01:02:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-19 01:02:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-19 01:02:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-19 01:02:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-19 01:02:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-19 01:02:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-11-19 01:02:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-11-19 01:02:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2024-11-19 01:02:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:02:00,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:02:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:02:00,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:02:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:02:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:02:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 01:02:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-19 01:02:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-19 01:02:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:02:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-19 01:02:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-19 01:02:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-11-19 01:02:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2024-11-19 01:02:00,863 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:02:00,865 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:02:01,450 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-19 01:02:01,451 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:02:01,466 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:02:01,466 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:02:01,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:02:01 BoogieIcfgContainer [2024-11-19 01:02:01,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:02:01,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:02:01,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:02:01,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:02:01,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:01:59" (1/3) ... [2024-11-19 01:02:01,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c697d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:02:01, skipping insertion in model container [2024-11-19 01:02:01,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:02:00" (2/3) ... [2024-11-19 01:02:01,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c697d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:02:01, skipping insertion in model container [2024-11-19 01:02:01,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:02:01" (3/3) ... [2024-11-19 01:02:01,475 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-88.i [2024-11-19 01:02:01,490 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:02:01,490 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:02:01,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:02:01,561 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;@4b1b4abc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:02:01,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:02:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:02:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 01:02:01,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:01,578 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:01,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:01,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash -700881897, now seen corresponding path program 1 times [2024-11-19 01:02:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:01,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954186748] [2024-11-19 01:02:01,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:01,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:01,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:01,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:01,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 01:02:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:01,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:02:01,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-19 01:02:01,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:01,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:01,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954186748] [2024-11-19 01:02:01,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954186748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:01,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:01,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:02:01,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382349830] [2024-11-19 01:02:01,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:01,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:02:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:02,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:02:02,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:02:02,006 INFO L87 Difference]: Start difference. First operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:02:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:02,044 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2024-11-19 01:02:02,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:02:02,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-11-19 01:02:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:02,053 INFO L225 Difference]: With dead ends: 215 [2024-11-19 01:02:02,054 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 01:02:02,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:02:02,060 INFO L432 NwaCegarLoop]: 156 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, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:02,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 01:02:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-19 01:02:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:02:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-11-19 01:02:02,104 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 139 [2024-11-19 01:02:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:02,106 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-11-19 01:02:02,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:02:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-11-19 01:02:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 01:02:02,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:02,110 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:02,118 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-19 01:02:02,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:02,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:02,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash -298632831, now seen corresponding path program 1 times [2024-11-19 01:02:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:02,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410385438] [2024-11-19 01:02:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:02,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:02,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:02,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:02,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 01:02:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:02,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 01:02:02,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:03,666 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-19 01:02:03,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 01:02:03,726 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 279 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-19 01:02:03,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:03,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:02:03,957 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 22 treesize of output 25 [2024-11-19 01:02:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:04,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:04,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410385438] [2024-11-19 01:02:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410385438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:02:04,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:02:04,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-19 01:02:04,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162817286] [2024-11-19 01:02:04,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:02:04,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 01:02:04,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:04,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 01:02:04,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:02:04,456 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 15 states, 13 states have (on average 7.769230769230769) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-19 01:02:05,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:05,317 INFO L93 Difference]: Finished difference Result 323 states and 469 transitions. [2024-11-19 01:02:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:02:05,318 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.769230769230769) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 139 [2024-11-19 01:02:05,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:05,321 INFO L225 Difference]: With dead ends: 323 [2024-11-19 01:02:05,321 INFO L226 Difference]: Without dead ends: 219 [2024-11-19 01:02:05,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:02:05,323 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 393 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:05,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1060 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:02:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-19 01:02:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 211. [2024-11-19 01:02:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 173 states have (on average 1.3815028901734103) internal successors, (239), 173 states have internal predecessors, (239), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:02:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 307 transitions. [2024-11-19 01:02:05,344 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 307 transitions. Word has length 139 [2024-11-19 01:02:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:05,344 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 307 transitions. [2024-11-19 01:02:05,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.769230769230769) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-19 01:02:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 307 transitions. [2024-11-19 01:02:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 01:02:05,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:05,347 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:05,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 01:02:05,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:05,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:05,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:05,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1249123652, now seen corresponding path program 1 times [2024-11-19 01:02:05,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:05,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827571348] [2024-11-19 01:02:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:05,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:05,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:05,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:05,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 01:02:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:05,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:02:05,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:05,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:05,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:05,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827571348] [2024-11-19 01:02:05,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827571348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:05,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:05,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:02:05,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105872842] [2024-11-19 01:02:05,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:05,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:05,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:05,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:05,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:05,869 INFO L87 Difference]: Start difference. First operand 211 states and 307 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:05,915 INFO L93 Difference]: Finished difference Result 433 states and 631 transitions. [2024-11-19 01:02:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:05,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-11-19 01:02:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:05,918 INFO L225 Difference]: With dead ends: 433 [2024-11-19 01:02:05,918 INFO L226 Difference]: Without dead ends: 225 [2024-11-19 01:02:05,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 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-19 01:02:05,919 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:05,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-19 01:02:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-11-19 01:02:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 185 states have internal predecessors, (251), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:02:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 319 transitions. [2024-11-19 01:02:05,943 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 319 transitions. Word has length 141 [2024-11-19 01:02:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:05,944 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 319 transitions. [2024-11-19 01:02:05,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 319 transitions. [2024-11-19 01:02:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 01:02:05,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:05,949 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:05,959 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-19 01:02:06,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:06,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:06,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash -569065282, now seen corresponding path program 1 times [2024-11-19 01:02:06,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:06,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053521675] [2024-11-19 01:02:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:06,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:06,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:06,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:06,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 01:02:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:06,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:02:06,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:06,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:06,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:06,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053521675] [2024-11-19 01:02:06,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053521675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:06,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:06,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:02:06,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024670006] [2024-11-19 01:02:06,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:06,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:02:06,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:06,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:02:06,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:06,429 INFO L87 Difference]: Start difference. First operand 223 states and 319 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:06,514 INFO L93 Difference]: Finished difference Result 453 states and 649 transitions. [2024-11-19 01:02:06,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:02:06,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-11-19 01:02:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:06,517 INFO L225 Difference]: With dead ends: 453 [2024-11-19 01:02:06,517 INFO L226 Difference]: Without dead ends: 233 [2024-11-19 01:02:06,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:06,519 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:06,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 992 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-19 01:02:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2024-11-19 01:02:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 193 states have (on average 1.3419689119170986) internal successors, (259), 193 states have internal predecessors, (259), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:02:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 327 transitions. [2024-11-19 01:02:06,545 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 327 transitions. Word has length 141 [2024-11-19 01:02:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:06,546 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 327 transitions. [2024-11-19 01:02:06,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 327 transitions. [2024-11-19 01:02:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 01:02:06,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:06,547 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:06,556 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-19 01:02:06,747 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-19 01:02:06,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:06,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash -567218240, now seen corresponding path program 1 times [2024-11-19 01:02:06,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:06,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816351710] [2024-11-19 01:02:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:06,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:06,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:06,751 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-19 01:02:06,752 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-19 01:02:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:06,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:02:06,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:07,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:02:07,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2024-11-19 01:02:07,494 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 67 treesize of output 51 [2024-11-19 01:02:07,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2024-11-19 01:02:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-19 01:02:07,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:07,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:07,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816351710] [2024-11-19 01:02:07,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816351710] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:07,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:07,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-19 01:02:07,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375901954] [2024-11-19 01:02:07,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:07,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:02:07,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:07,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:02:07,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:02:07,709 INFO L87 Difference]: Start difference. First operand 231 states and 327 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:07,914 INFO L93 Difference]: Finished difference Result 485 states and 680 transitions. [2024-11-19 01:02:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:07,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-11-19 01:02:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:07,918 INFO L225 Difference]: With dead ends: 485 [2024-11-19 01:02:07,918 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 01:02:07,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:02:07,919 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 269 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:07,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 580 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:02:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 01:02:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 243. [2024-11-19 01:02:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 203 states have (on average 1.3251231527093597) internal successors, (269), 203 states have internal predecessors, (269), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:02:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 337 transitions. [2024-11-19 01:02:07,935 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 337 transitions. Word has length 141 [2024-11-19 01:02:07,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:07,936 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 337 transitions. [2024-11-19 01:02:07,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 337 transitions. [2024-11-19 01:02:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:02:07,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:07,938 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:07,945 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 (6)] Ended with exit code 0 [2024-11-19 01:02:08,138 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-19 01:02:08,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:08,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:08,139 INFO L85 PathProgramCache]: Analyzing trace with hash -918110542, now seen corresponding path program 1 times [2024-11-19 01:02:08,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:08,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098763317] [2024-11-19 01:02:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:08,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:08,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:08,142 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-19 01:02:08,144 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-19 01:02:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:08,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:02:08,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:08,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:08,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:08,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098763317] [2024-11-19 01:02:08,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098763317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:08,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:08,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:02:08,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76366270] [2024-11-19 01:02:08,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:08,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:08,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:08,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:08,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:02:08,377 INFO L87 Difference]: Start difference. First operand 243 states and 337 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:08,405 INFO L93 Difference]: Finished difference Result 489 states and 679 transitions. [2024-11-19 01:02:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:02:08,406 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-19 01:02:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:08,407 INFO L225 Difference]: With dead ends: 489 [2024-11-19 01:02:08,407 INFO L226 Difference]: Without dead ends: 249 [2024-11-19 01:02:08,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 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-19 01:02:08,408 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 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-19 01:02:08,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-19 01:02:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-11-19 01:02:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.3157894736842106) internal successors, (275), 209 states have internal predecessors, (275), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:02:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 343 transitions. [2024-11-19 01:02:08,422 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 343 transitions. Word has length 143 [2024-11-19 01:02:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:08,422 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 343 transitions. [2024-11-19 01:02:08,422 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 343 transitions. [2024-11-19 01:02:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-19 01:02:08,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:08,423 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:08,430 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-19 01:02:08,627 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-19 01:02:08,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:08,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash 871741840, now seen corresponding path program 1 times [2024-11-19 01:02:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975309908] [2024-11-19 01:02:08,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:08,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:08,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:08,630 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-19 01:02:08,631 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-19 01:02:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:08,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 01:02:08,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:02:09,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:09,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975309908] [2024-11-19 01:02:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975309908] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:09,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-19 01:02:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004241858] [2024-11-19 01:02:09,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:09,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:09,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:02:09,275 INFO L87 Difference]: Start difference. First operand 249 states and 343 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:09,344 INFO L93 Difference]: Finished difference Result 623 states and 860 transitions. [2024-11-19 01:02:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:09,346 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2024-11-19 01:02:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:09,348 INFO L225 Difference]: With dead ends: 623 [2024-11-19 01:02:09,348 INFO L226 Difference]: Without dead ends: 377 [2024-11-19 01:02:09,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 277 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-19 01:02:09,349 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 66 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:09,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 607 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-19 01:02:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 285. [2024-11-19 01:02:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 245 states have (on average 1.3428571428571427) internal successors, (329), 245 states have internal predecessors, (329), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:02:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 397 transitions. [2024-11-19 01:02:09,365 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 397 transitions. Word has length 144 [2024-11-19 01:02:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:09,366 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 397 transitions. [2024-11-19 01:02:09,366 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 397 transitions. [2024-11-19 01:02:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-19 01:02:09,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:09,367 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:09,376 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-19 01:02:09,567 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-19 01:02:09,568 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:09,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash 799355282, now seen corresponding path program 1 times [2024-11-19 01:02:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657608587] [2024-11-19 01:02:09,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:09,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:09,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:09,570 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-19 01:02:09,571 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-19 01:02:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:09,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:02:09,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:09,803 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-19 01:02:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:09,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:09,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:09,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657608587] [2024-11-19 01:02:09,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657608587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:09,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:09,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:02:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788348843] [2024-11-19 01:02:09,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:09,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:09,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:09,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:09,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:02:09,952 INFO L87 Difference]: Start difference. First operand 285 states and 397 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:10,085 INFO L93 Difference]: Finished difference Result 791 states and 1101 transitions. [2024-11-19 01:02:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:02:10,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2024-11-19 01:02:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:10,088 INFO L225 Difference]: With dead ends: 791 [2024-11-19 01:02:10,088 INFO L226 Difference]: Without dead ends: 509 [2024-11-19 01:02:10,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:02:10,091 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 145 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:10,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 598 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-19 01:02:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 340. [2024-11-19 01:02:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 280 states have (on average 1.3107142857142857) internal successors, (367), 280 states have internal predecessors, (367), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-19 01:02:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 469 transitions. [2024-11-19 01:02:10,111 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 469 transitions. Word has length 144 [2024-11-19 01:02:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:10,111 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 469 transitions. [2024-11-19 01:02:10,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 469 transitions. [2024-11-19 01:02:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 01:02:10,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:10,113 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:10,120 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-19 01:02:10,317 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-19 01:02:10,318 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:10,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:10,319 INFO L85 PathProgramCache]: Analyzing trace with hash 523164247, now seen corresponding path program 1 times [2024-11-19 01:02:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:10,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316131688] [2024-11-19 01:02:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:10,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:10,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:10,320 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-19 01:02:10,321 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-19 01:02:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:10,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 01:02:10,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:02:10,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:10,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316131688] [2024-11-19 01:02:10,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316131688] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:10,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:10,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-19 01:02:10,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330227612] [2024-11-19 01:02:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:10,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:10,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:10,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:10,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:02:10,897 INFO L87 Difference]: Start difference. First operand 340 states and 469 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:10,964 INFO L93 Difference]: Finished difference Result 700 states and 964 transitions. [2024-11-19 01:02:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:02:10,964 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-19 01:02:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:10,966 INFO L225 Difference]: With dead ends: 700 [2024-11-19 01:02:10,967 INFO L226 Difference]: Without dead ends: 418 [2024-11-19 01:02:10,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 279 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-19 01:02:10,969 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 58 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:10,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 580 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-19 01:02:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 348. [2024-11-19 01:02:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 288 states have (on average 1.3020833333333333) internal successors, (375), 288 states have internal predecessors, (375), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-19 01:02:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 477 transitions. [2024-11-19 01:02:10,983 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 477 transitions. Word has length 145 [2024-11-19 01:02:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:10,984 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 477 transitions. [2024-11-19 01:02:10,984 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 477 transitions. [2024-11-19 01:02:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 01:02:10,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:10,985 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:10,992 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-19 01:02:11,185 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-19 01:02:11,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:11,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1256949642, now seen corresponding path program 1 times [2024-11-19 01:02:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424625087] [2024-11-19 01:02:11,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:11,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:11,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:11,189 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-19 01:02:11,190 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-19 01:02:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:11,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 01:02:11,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:11,452 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 22 treesize of output 18 [2024-11-19 01:02:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:11,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:11,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:11,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424625087] [2024-11-19 01:02:11,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424625087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:11,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:11,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:02:11,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278887634] [2024-11-19 01:02:11,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:11,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:11,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:11,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:11,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:11,527 INFO L87 Difference]: Start difference. First operand 348 states and 477 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:11,702 INFO L93 Difference]: Finished difference Result 816 states and 1110 transitions. [2024-11-19 01:02:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:11,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-19 01:02:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:11,707 INFO L225 Difference]: With dead ends: 816 [2024-11-19 01:02:11,707 INFO L226 Difference]: Without dead ends: 526 [2024-11-19 01:02:11,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:02:11,708 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 78 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:11,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 835 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-19 01:02:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 522. [2024-11-19 01:02:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 442 states have (on average 1.2873303167420815) internal successors, (569), 444 states have internal predecessors, (569), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:02:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 703 transitions. [2024-11-19 01:02:11,730 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 703 transitions. Word has length 146 [2024-11-19 01:02:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:11,730 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 703 transitions. [2024-11-19 01:02:11,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 703 transitions. [2024-11-19 01:02:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 01:02:11,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:11,731 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:11,743 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 (11)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:11,935 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-19 01:02:11,936 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:11,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -173080584, now seen corresponding path program 1 times [2024-11-19 01:02:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:11,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923331892] [2024-11-19 01:02:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:11,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:11,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:11,938 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-19 01:02:11,939 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-19 01:02:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:12,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 01:02:12,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:12,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 01:02:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:02:12,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:12,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:12,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923331892] [2024-11-19 01:02:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923331892] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:12,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-19 01:02:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969066843] [2024-11-19 01:02:12,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:12,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:12,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:02:12,537 INFO L87 Difference]: Start difference. First operand 522 states and 703 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:12,617 INFO L93 Difference]: Finished difference Result 1118 states and 1509 transitions. [2024-11-19 01:02:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:02:12,618 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-19 01:02:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:12,624 INFO L225 Difference]: With dead ends: 1118 [2024-11-19 01:02:12,624 INFO L226 Difference]: Without dead ends: 654 [2024-11-19 01:02:12,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:02:12,625 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 164 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:12,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 542 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-19 01:02:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 522. [2024-11-19 01:02:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 442 states have (on average 1.2828054298642535) internal successors, (567), 444 states have internal predecessors, (567), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:02:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 701 transitions. [2024-11-19 01:02:12,645 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 701 transitions. Word has length 146 [2024-11-19 01:02:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:12,645 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 701 transitions. [2024-11-19 01:02:12,646 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 701 transitions. [2024-11-19 01:02:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 01:02:12,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:12,647 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:12,654 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 (12)] Ended with exit code 0 [2024-11-19 01:02:12,851 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-19 01:02:12,851 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:12,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash 231910010, now seen corresponding path program 1 times [2024-11-19 01:02:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:12,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426337727] [2024-11-19 01:02:12,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:12,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:12,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:12,854 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-19 01:02:12,854 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-19 01:02:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:13,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 01:02:13,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:13,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:02:13,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-11-19 01:02:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-19 01:02:13,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:13,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426337727] [2024-11-19 01:02:13,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426337727] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:13,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:13,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-11-19 01:02:13,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237689651] [2024-11-19 01:02:13,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:13,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:13,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:13,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:02:13,371 INFO L87 Difference]: Start difference. First operand 522 states and 701 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:13,520 INFO L93 Difference]: Finished difference Result 978 states and 1319 transitions. [2024-11-19 01:02:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:13,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-19 01:02:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:13,524 INFO L225 Difference]: With dead ends: 978 [2024-11-19 01:02:13,524 INFO L226 Difference]: Without dead ends: 514 [2024-11-19 01:02:13,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:02:13,526 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 82 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:13,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 687 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-19 01:02:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 506. [2024-11-19 01:02:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 426 states have (on average 1.284037558685446) internal successors, (547), 428 states have internal predecessors, (547), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:02:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 681 transitions. [2024-11-19 01:02:13,553 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 681 transitions. Word has length 146 [2024-11-19 01:02:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:13,553 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 681 transitions. [2024-11-19 01:02:13,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 681 transitions. [2024-11-19 01:02:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 01:02:13,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:13,554 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:13,561 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-19 01:02:13,758 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-19 01:02:13,759 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:13,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2131753299, now seen corresponding path program 1 times [2024-11-19 01:02:13,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:13,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610466034] [2024-11-19 01:02:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:13,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:13,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:13,761 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-19 01:02:13,761 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-19 01:02:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:13,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 01:02:13,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:02:14,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:14,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:14,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610466034] [2024-11-19 01:02:14,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610466034] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:14,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:14,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-19 01:02:14,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417104331] [2024-11-19 01:02:14,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:14,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:14,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:02:14,374 INFO L87 Difference]: Start difference. First operand 506 states and 681 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:14,447 INFO L93 Difference]: Finished difference Result 853 states and 1152 transitions. [2024-11-19 01:02:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:02:14,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-19 01:02:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:14,450 INFO L225 Difference]: With dead ends: 853 [2024-11-19 01:02:14,450 INFO L226 Difference]: Without dead ends: 626 [2024-11-19 01:02:14,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:02:14,453 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 71 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:14,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 678 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-19 01:02:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 525. [2024-11-19 01:02:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 445 states have (on average 1.2921348314606742) internal successors, (575), 447 states have internal predecessors, (575), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:02:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 709 transitions. [2024-11-19 01:02:14,471 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 709 transitions. Word has length 147 [2024-11-19 01:02:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:14,472 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 709 transitions. [2024-11-19 01:02:14,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 709 transitions. [2024-11-19 01:02:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 01:02:14,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:14,473 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:14,479 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 (14)] Ended with exit code 0 [2024-11-19 01:02:14,673 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-19 01:02:14,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:14,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1912898581, now seen corresponding path program 1 times [2024-11-19 01:02:14,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:14,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392546855] [2024-11-19 01:02:14,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:14,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:14,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:14,676 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-19 01:02:14,677 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-19 01:02:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:14,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:02:14,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:14,900 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-19 01:02:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:15,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:15,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:15,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392546855] [2024-11-19 01:02:15,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392546855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:15,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:15,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:02:15,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466684069] [2024-11-19 01:02:15,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:15,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:15,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:15,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:15,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:02:15,031 INFO L87 Difference]: Start difference. First operand 525 states and 709 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:15,155 INFO L93 Difference]: Finished difference Result 1232 states and 1665 transitions. [2024-11-19 01:02:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:02:15,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-19 01:02:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:15,159 INFO L225 Difference]: With dead ends: 1232 [2024-11-19 01:02:15,159 INFO L226 Difference]: Without dead ends: 765 [2024-11-19 01:02:15,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 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-19 01:02:15,162 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 129 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:15,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 591 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:02:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-11-19 01:02:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 581. [2024-11-19 01:02:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 501 states have (on average 1.3053892215568863) internal successors, (654), 503 states have internal predecessors, (654), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:02:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 788 transitions. [2024-11-19 01:02:15,185 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 788 transitions. Word has length 147 [2024-11-19 01:02:15,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:15,186 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 788 transitions. [2024-11-19 01:02:15,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 788 transitions. [2024-11-19 01:02:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:02:15,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:15,187 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:15,197 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-19 01:02:15,387 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-19 01:02:15,388 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:15,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:15,388 INFO L85 PathProgramCache]: Analyzing trace with hash 159670609, now seen corresponding path program 1 times [2024-11-19 01:02:15,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:15,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891736624] [2024-11-19 01:02:15,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:15,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:15,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:15,391 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-19 01:02:15,392 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-19 01:02:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:15,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 01:02:15,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:15,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:15,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:15,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891736624] [2024-11-19 01:02:15,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891736624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:15,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:15,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:02:15,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67712348] [2024-11-19 01:02:15,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:15,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:02:15,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:15,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:02:15,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:02:15,640 INFO L87 Difference]: Start difference. First operand 581 states and 788 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:15,666 INFO L93 Difference]: Finished difference Result 1068 states and 1453 transitions. [2024-11-19 01:02:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:02:15,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-19 01:02:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:15,669 INFO L225 Difference]: With dead ends: 1068 [2024-11-19 01:02:15,669 INFO L226 Difference]: Without dead ends: 589 [2024-11-19 01:02:15,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 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-19 01:02:15,671 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:15,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-19 01:02:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2024-11-19 01:02:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 509 states have (on average 1.300589390962672) internal successors, (662), 511 states have internal predecessors, (662), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:02:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 796 transitions. [2024-11-19 01:02:15,688 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 796 transitions. Word has length 148 [2024-11-19 01:02:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:15,689 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 796 transitions. [2024-11-19 01:02:15,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 796 transitions. [2024-11-19 01:02:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:02:15,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:15,692 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:15,698 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 (16)] Ended with exit code 0 [2024-11-19 01:02:15,892 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-19 01:02:15,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:15,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1026341733, now seen corresponding path program 1 times [2024-11-19 01:02:15,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:15,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785869567] [2024-11-19 01:02:15,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:15,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:15,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:15,894 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-19 01:02:15,895 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-19 01:02:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:16,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 01:02:16,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:16,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:16,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785869567] [2024-11-19 01:02:16,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785869567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:16,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:16,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:02:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961785273] [2024-11-19 01:02:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:16,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:02:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:16,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:02:16,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:02:16,148 INFO L87 Difference]: Start difference. First operand 589 states and 796 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:16,171 INFO L93 Difference]: Finished difference Result 1065 states and 1443 transitions. [2024-11-19 01:02:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:02:16,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-19 01:02:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:16,174 INFO L225 Difference]: With dead ends: 1065 [2024-11-19 01:02:16,174 INFO L226 Difference]: Without dead ends: 593 [2024-11-19 01:02:16,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 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-19 01:02:16,176 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:16,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-19 01:02:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2024-11-19 01:02:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 513 states have (on average 1.2982456140350878) internal successors, (666), 515 states have internal predecessors, (666), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:02:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 800 transitions. [2024-11-19 01:02:16,194 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 800 transitions. Word has length 148 [2024-11-19 01:02:16,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:16,195 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 800 transitions. [2024-11-19 01:02:16,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 800 transitions. [2024-11-19 01:02:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:02:16,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:16,196 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:16,207 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-19 01:02:16,396 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 [2024-11-19 01:02:16,397 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:16,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash 896092934, now seen corresponding path program 1 times [2024-11-19 01:02:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91732863] [2024-11-19 01:02:16,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:16,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:16,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:16,401 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:16,401 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 (18)] Waiting until timeout for monitored process [2024-11-19 01:02:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:16,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 01:02:16,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:17,345 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-19 01:02:17,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 01:02:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 279 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-19 01:02:17,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:17,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:02:17,561 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 22 treesize of output 25 [2024-11-19 01:02:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-19 01:02:18,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:18,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91732863] [2024-11-19 01:02:18,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91732863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:02:18,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:02:18,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-19 01:02:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277764032] [2024-11-19 01:02:18,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:02:18,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 01:02:18,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:18,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 01:02:18,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:02:18,018 INFO L87 Difference]: Start difference. First operand 593 states and 800 transitions. Second operand has 15 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-19 01:02:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:18,679 INFO L93 Difference]: Finished difference Result 1097 states and 1475 transitions. [2024-11-19 01:02:18,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:02:18,680 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 148 [2024-11-19 01:02:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:18,682 INFO L225 Difference]: With dead ends: 1097 [2024-11-19 01:02:18,682 INFO L226 Difference]: Without dead ends: 621 [2024-11-19 01:02:18,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:02:18,684 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 501 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:18,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 991 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:02:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-19 01:02:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 593. [2024-11-19 01:02:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 513 states have (on average 1.2943469785575048) internal successors, (664), 515 states have internal predecessors, (664), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:02:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 798 transitions. [2024-11-19 01:02:18,711 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 798 transitions. Word has length 148 [2024-11-19 01:02:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:18,712 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 798 transitions. [2024-11-19 01:02:18,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 10.0) internal successors, (130), 14 states have internal predecessors, (130), 6 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-19 01:02:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 798 transitions. [2024-11-19 01:02:18,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 01:02:18,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:18,713 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:18,720 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 (18)] Ended with exit code 0 [2024-11-19 01:02:18,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:18,918 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:18,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash -422583160, now seen corresponding path program 1 times [2024-11-19 01:02:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:18,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387712676] [2024-11-19 01:02:18,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:18,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:18,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:18,920 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-19 01:02:18,921 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-19 01:02:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:19,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 01:02:19,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:02:19,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:19,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:19,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387712676] [2024-11-19 01:02:19,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387712676] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:19,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:19,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-19 01:02:19,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374757913] [2024-11-19 01:02:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:19,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:19,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:19,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:02:19,422 INFO L87 Difference]: Start difference. First operand 593 states and 798 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:19,474 INFO L93 Difference]: Finished difference Result 990 states and 1326 transitions. [2024-11-19 01:02:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:02:19,475 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-19 01:02:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:19,478 INFO L225 Difference]: With dead ends: 990 [2024-11-19 01:02:19,478 INFO L226 Difference]: Without dead ends: 721 [2024-11-19 01:02:19,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 285 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-19 01:02:19,479 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 67 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:19,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 581 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-19 01:02:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 573. [2024-11-19 01:02:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 493 states have (on average 1.2839756592292089) internal successors, (633), 495 states have internal predecessors, (633), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-19 01:02:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 767 transitions. [2024-11-19 01:02:19,497 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 767 transitions. Word has length 148 [2024-11-19 01:02:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:19,498 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 767 transitions. [2024-11-19 01:02:19,498 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 767 transitions. [2024-11-19 01:02:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:19,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:19,499 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:19,506 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-19 01:02:19,699 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-19 01:02:19,699 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:19,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:19,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1619674166, now seen corresponding path program 1 times [2024-11-19 01:02:19,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:19,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981143746] [2024-11-19 01:02:19,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:19,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:19,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:19,701 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-19 01:02:19,703 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-19 01:02:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:19,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:02:19,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:20,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:20,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:20,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981143746] [2024-11-19 01:02:20,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981143746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:20,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:20,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:02:20,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999005630] [2024-11-19 01:02:20,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:20,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:20,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:20,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:20,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:20,172 INFO L87 Difference]: Start difference. First operand 573 states and 767 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:20,514 INFO L93 Difference]: Finished difference Result 1175 states and 1568 transitions. [2024-11-19 01:02:20,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:02:20,515 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:20,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:20,518 INFO L225 Difference]: With dead ends: 1175 [2024-11-19 01:02:20,518 INFO L226 Difference]: Without dead ends: 701 [2024-11-19 01:02:20,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:02:20,519 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 230 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:20,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 773 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:02:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-19 01:02:20,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 682. [2024-11-19 01:02:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 581 states have (on average 1.2685025817555937) internal successors, (737), 584 states have internal predecessors, (737), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-19 01:02:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 905 transitions. [2024-11-19 01:02:20,546 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 905 transitions. Word has length 150 [2024-11-19 01:02:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:20,546 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 905 transitions. [2024-11-19 01:02:20,546 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 905 transitions. [2024-11-19 01:02:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:20,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:20,548 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:20,555 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 (20)] Ended with exit code 0 [2024-11-19 01:02:20,748 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-19 01:02:20,749 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:20,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:20,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1853492789, now seen corresponding path program 1 times [2024-11-19 01:02:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:20,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726194050] [2024-11-19 01:02:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:20,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:20,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:20,751 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-19 01:02:20,752 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-19 01:02:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:21,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:02:21,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:21,053 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 12 treesize of output 8 [2024-11-19 01:02:21,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-19 01:02:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:21,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:21,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:21,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726194050] [2024-11-19 01:02:21,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726194050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:21,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:21,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:02:21,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866608036] [2024-11-19 01:02:21,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:21,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:02:21,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:21,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:02:21,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:02:21,093 INFO L87 Difference]: Start difference. First operand 682 states and 905 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:21,154 INFO L93 Difference]: Finished difference Result 1263 states and 1677 transitions. [2024-11-19 01:02:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:02:21,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:21,157 INFO L225 Difference]: With dead ends: 1263 [2024-11-19 01:02:21,157 INFO L226 Difference]: Without dead ends: 682 [2024-11-19 01:02:21,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-19 01:02:21,159 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 131 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:21,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 780 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-19 01:02:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2024-11-19 01:02:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 581 states have (on average 1.2598967297762478) internal successors, (732), 584 states have internal predecessors, (732), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-19 01:02:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 900 transitions. [2024-11-19 01:02:21,183 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 900 transitions. Word has length 150 [2024-11-19 01:02:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:21,183 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 900 transitions. [2024-11-19 01:02:21,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 900 transitions. [2024-11-19 01:02:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:21,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:21,184 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:21,191 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-19 01:02:21,384 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-19 01:02:21,385 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:21,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash 664620103, now seen corresponding path program 1 times [2024-11-19 01:02:21,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:21,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623365835] [2024-11-19 01:02:21,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:21,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:21,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:21,388 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-19 01:02:21,389 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-19 01:02:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:21,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 01:02:21,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:21,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:02:22,029 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 51 treesize of output 39 [2024-11-19 01:02:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 01:02:22,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:22,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623365835] [2024-11-19 01:02:22,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623365835] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:22,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:22,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-11-19 01:02:22,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503872746] [2024-11-19 01:02:22,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:22,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:22,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:22,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:02:22,156 INFO L87 Difference]: Start difference. First operand 682 states and 900 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:22,253 INFO L93 Difference]: Finished difference Result 711 states and 930 transitions. [2024-11-19 01:02:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:22,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:22,257 INFO L225 Difference]: With dead ends: 711 [2024-11-19 01:02:22,257 INFO L226 Difference]: Without dead ends: 709 [2024-11-19 01:02:22,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:02:22,258 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 101 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:22,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 906 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-19 01:02:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 701. [2024-11-19 01:02:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 600 states have (on average 1.2516666666666667) internal successors, (751), 603 states have internal predecessors, (751), 82 states have call successors, (82), 18 states have call predecessors, (82), 18 states have return successors, (82), 79 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-19 01:02:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 915 transitions. [2024-11-19 01:02:22,294 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 915 transitions. Word has length 150 [2024-11-19 01:02:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:22,295 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 915 transitions. [2024-11-19 01:02:22,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 915 transitions. [2024-11-19 01:02:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:22,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:22,296 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:22,307 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 (22)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:22,496 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-19 01:02:22,497 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:22,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash 666467145, now seen corresponding path program 1 times [2024-11-19 01:02:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:22,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628315287] [2024-11-19 01:02:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:22,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:22,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:22,501 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-19 01:02:22,502 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-19 01:02:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:22,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 01:02:22,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:23,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 01:02:23,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 89 [2024-11-19 01:02:23,714 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 137 treesize of output 77 [2024-11-19 01:02:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-19 01:02:23,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:23,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628315287] [2024-11-19 01:02:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628315287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [576216609] [2024-11-19 01:02:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:02:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:02:23,890 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-19 01:02:23,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-19 01:02:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:24,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 01:02:24,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:25,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 01:02:25,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 01:02:26,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 89 [2024-11-19 01:02:26,092 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 137 treesize of output 77 [2024-11-19 01:02:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-19 01:02:26,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [576216609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:26,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:02:26,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-19 01:02:26,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185995587] [2024-11-19 01:02:26,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:02:26,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 01:02:26,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:26,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 01:02:26,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:02:26,230 INFO L87 Difference]: Start difference. First operand 701 states and 915 transitions. Second operand has 16 states, 16 states have (on average 8.5) internal successors, (136), 15 states have internal predecessors, (136), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-19 01:02:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:27,199 INFO L93 Difference]: Finished difference Result 1961 states and 2548 transitions. [2024-11-19 01:02:27,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:02:27,200 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.5) internal successors, (136), 15 states have internal predecessors, (136), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 150 [2024-11-19 01:02:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:27,205 INFO L225 Difference]: With dead ends: 1961 [2024-11-19 01:02:27,205 INFO L226 Difference]: Without dead ends: 1361 [2024-11-19 01:02:27,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-19 01:02:27,207 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 480 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:27,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1661 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:02:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-19 01:02:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1351. [2024-11-19 01:02:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1165 states have (on average 1.248068669527897) internal successors, (1454), 1173 states have internal predecessors, (1454), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-19 01:02:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1752 transitions. [2024-11-19 01:02:27,274 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1752 transitions. Word has length 150 [2024-11-19 01:02:27,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:27,274 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1752 transitions. [2024-11-19 01:02:27,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.5) internal successors, (136), 15 states have internal predecessors, (136), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-19 01:02:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1752 transitions. [2024-11-19 01:02:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:27,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:27,275 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:27,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:27,481 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 (23)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:27,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:27,676 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:27,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:27,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1173434419, now seen corresponding path program 1 times [2024-11-19 01:02:27,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:27,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086115798] [2024-11-19 01:02:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:27,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:27,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:27,678 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:27,679 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 (25)] Waiting until timeout for monitored process [2024-11-19 01:02:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:27,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 01:02:27,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:28,105 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 18 treesize of output 14 [2024-11-19 01:02:28,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-19 01:02:28,181 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 29 treesize of output 17 [2024-11-19 01:02:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:28,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:28,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:28,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086115798] [2024-11-19 01:02:28,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086115798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:28,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:28,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:02:28,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924504927] [2024-11-19 01:02:28,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:28,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:02:28,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:28,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:02:28,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:02:28,210 INFO L87 Difference]: Start difference. First operand 1351 states and 1752 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:28,743 INFO L93 Difference]: Finished difference Result 3331 states and 4298 transitions. [2024-11-19 01:02:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:02:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:28,751 INFO L225 Difference]: With dead ends: 3331 [2024-11-19 01:02:28,751 INFO L226 Difference]: Without dead ends: 2138 [2024-11-19 01:02:28,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-19 01:02:28,754 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 219 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:28,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1638 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:02:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2024-11-19 01:02:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1665. [2024-11-19 01:02:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1479 states have (on average 1.2616632860040569) internal successors, (1866), 1487 states have internal predecessors, (1866), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-19 01:02:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2164 transitions. [2024-11-19 01:02:28,837 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2164 transitions. Word has length 150 [2024-11-19 01:02:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:28,837 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2164 transitions. [2024-11-19 01:02:28,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2164 transitions. [2024-11-19 01:02:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:28,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:28,839 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:28,847 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 (25)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:29,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:29,040 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:29,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1760240433, now seen corresponding path program 1 times [2024-11-19 01:02:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024479692] [2024-11-19 01:02:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:29,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:29,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:29,042 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:29,043 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 (26)] Waiting until timeout for monitored process [2024-11-19 01:02:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:29,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:02:29,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:29,442 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-19 01:02:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:29,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:29,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024479692] [2024-11-19 01:02:29,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024479692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:29,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:29,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:02:29,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919597706] [2024-11-19 01:02:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:29,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:02:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:02:29,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:02:29,447 INFO L87 Difference]: Start difference. First operand 1665 states and 2164 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:29,563 INFO L93 Difference]: Finished difference Result 3160 states and 4107 transitions. [2024-11-19 01:02:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:02:29,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:29,568 INFO L225 Difference]: With dead ends: 3160 [2024-11-19 01:02:29,568 INFO L226 Difference]: Without dead ends: 1683 [2024-11-19 01:02:29,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:02:29,571 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 63 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:29,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 434 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-11-19 01:02:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1665. [2024-11-19 01:02:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1479 states have (on average 1.2535496957403651) internal successors, (1854), 1487 states have internal predecessors, (1854), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-19 01:02:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2152 transitions. [2024-11-19 01:02:29,683 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2152 transitions. Word has length 150 [2024-11-19 01:02:29,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:29,684 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2152 transitions. [2024-11-19 01:02:29,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2152 transitions. [2024-11-19 01:02:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:29,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:29,686 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:29,693 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 (26)] Ended with exit code 0 [2024-11-19 01:02:29,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:29,887 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:29,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1505061110, now seen corresponding path program 1 times [2024-11-19 01:02:29,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:29,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775387087] [2024-11-19 01:02:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:29,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:29,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:29,889 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:29,891 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 (27)] Waiting until timeout for monitored process [2024-11-19 01:02:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:30,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:02:30,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:30,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:30,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:30,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775387087] [2024-11-19 01:02:30,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775387087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:30,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:30,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:02:30,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226365206] [2024-11-19 01:02:30,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:30,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:02:30,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:30,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:02:30,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:02:30,383 INFO L87 Difference]: Start difference. First operand 1665 states and 2152 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:30,733 INFO L93 Difference]: Finished difference Result 3189 states and 4123 transitions. [2024-11-19 01:02:30,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:02:30,735 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:30,740 INFO L225 Difference]: With dead ends: 3189 [2024-11-19 01:02:30,741 INFO L226 Difference]: Without dead ends: 1712 [2024-11-19 01:02:30,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:02:30,744 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 185 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:30,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 735 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:02:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2024-11-19 01:02:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1657. [2024-11-19 01:02:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1471 states have (on average 1.2494901427600271) internal successors, (1838), 1479 states have internal predecessors, (1838), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-19 01:02:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2136 transitions. [2024-11-19 01:02:30,822 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2136 transitions. Word has length 150 [2024-11-19 01:02:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:30,822 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2136 transitions. [2024-11-19 01:02:30,822 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2136 transitions. [2024-11-19 01:02:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:30,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:30,824 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:30,831 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 (27)] Ended with exit code 0 [2024-11-19 01:02:31,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:31,025 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:31,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1245820977, now seen corresponding path program 1 times [2024-11-19 01:02:31,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:31,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473464257] [2024-11-19 01:02:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:31,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:31,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:31,027 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:31,027 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 (28)] Waiting until timeout for monitored process [2024-11-19 01:02:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:31,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:02:31,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:31,400 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-19 01:02:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:31,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:31,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473464257] [2024-11-19 01:02:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473464257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:31,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:31,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:02:31,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078202482] [2024-11-19 01:02:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:31,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:02:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:31,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:02:31,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:02:31,406 INFO L87 Difference]: Start difference. First operand 1657 states and 2136 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:31,530 INFO L93 Difference]: Finished difference Result 2876 states and 3697 transitions. [2024-11-19 01:02:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:02:31,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:31,535 INFO L225 Difference]: With dead ends: 2876 [2024-11-19 01:02:31,535 INFO L226 Difference]: Without dead ends: 1377 [2024-11-19 01:02:31,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:02:31,538 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 82 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:31,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 448 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2024-11-19 01:02:31,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1359. [2024-11-19 01:02:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1173 states have (on average 1.227621483375959) internal successors, (1440), 1181 states have internal predecessors, (1440), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-19 01:02:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1738 transitions. [2024-11-19 01:02:31,609 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1738 transitions. Word has length 150 [2024-11-19 01:02:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:31,609 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1738 transitions. [2024-11-19 01:02:31,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1738 transitions. [2024-11-19 01:02:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:31,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:31,610 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:31,619 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 (28)] Ended with exit code 0 [2024-11-19 01:02:31,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:31,811 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:31,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash -576673775, now seen corresponding path program 1 times [2024-11-19 01:02:31,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:31,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182435710] [2024-11-19 01:02:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:31,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:31,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:31,813 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:31,814 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 (29)] Waiting until timeout for monitored process [2024-11-19 01:02:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:32,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 01:02:32,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:32,822 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 19 treesize of output 15 [2024-11-19 01:02:32,863 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 24 treesize of output 16 [2024-11-19 01:02:32,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 01:02:32,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-19 01:02:32,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 34 treesize of output 22 [2024-11-19 01:02:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 10 proven. 414 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 01:02:34,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:34,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:34,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182435710] [2024-11-19 01:02:34,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182435710] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:34,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:34,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2024-11-19 01:02:34,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449603417] [2024-11-19 01:02:34,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:34,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:02:34,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:34,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:02:35,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-11-19 01:02:35,000 INFO L87 Difference]: Start difference. First operand 1359 states and 1738 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:35,832 INFO L93 Difference]: Finished difference Result 2629 states and 3398 transitions. [2024-11-19 01:02:35,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:02:35,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:35,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:35,839 INFO L225 Difference]: With dead ends: 2629 [2024-11-19 01:02:35,839 INFO L226 Difference]: Without dead ends: 2101 [2024-11-19 01:02:35,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-11-19 01:02:35,841 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 226 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:35,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 990 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:02:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2024-11-19 01:02:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 1489. [2024-11-19 01:02:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1303 states have (on average 1.2463545663852649) internal successors, (1624), 1311 states have internal predecessors, (1624), 149 states have call successors, (149), 36 states have call predecessors, (149), 36 states have return successors, (149), 141 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-19 01:02:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1922 transitions. [2024-11-19 01:02:35,920 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1922 transitions. Word has length 150 [2024-11-19 01:02:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:35,920 INFO L471 AbstractCegarLoop]: Abstraction has 1489 states and 1922 transitions. [2024-11-19 01:02:35,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1922 transitions. [2024-11-19 01:02:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:35,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:35,922 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:35,929 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 (29)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:36,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:36,123 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:36,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:36,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2129945619, now seen corresponding path program 1 times [2024-11-19 01:02:36,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845120332] [2024-11-19 01:02:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:36,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:36,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:36,125 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:36,126 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 (30)] Waiting until timeout for monitored process [2024-11-19 01:02:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:36,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 01:02:36,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:36,828 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 19 treesize of output 15 [2024-11-19 01:02:36,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 01:02:36,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-19 01:02:36,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-19 01:02:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 399 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-19 01:02:37,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:37,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845120332] [2024-11-19 01:02:37,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845120332] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:37,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:37,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2024-11-19 01:02:37,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735875873] [2024-11-19 01:02:37,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:37,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:02:37,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:37,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:02:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:02:37,303 INFO L87 Difference]: Start difference. First operand 1489 states and 1922 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:38,038 INFO L93 Difference]: Finished difference Result 2789 states and 3605 transitions. [2024-11-19 01:02:38,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 01:02:38,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:38,045 INFO L225 Difference]: With dead ends: 2789 [2024-11-19 01:02:38,045 INFO L226 Difference]: Without dead ends: 2161 [2024-11-19 01:02:38,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 01:02:38,047 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 281 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:38,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1709 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:02:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2024-11-19 01:02:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 1891. [2024-11-19 01:02:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1672 states have (on average 1.2517942583732058) internal successors, (2093), 1684 states have internal predecessors, (2093), 173 states have call successors, (173), 45 states have call predecessors, (173), 45 states have return successors, (173), 161 states have call predecessors, (173), 173 states have call successors, (173) [2024-11-19 01:02:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2439 transitions. [2024-11-19 01:02:38,153 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2439 transitions. Word has length 150 [2024-11-19 01:02:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:38,153 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2439 transitions. [2024-11-19 01:02:38,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2439 transitions. [2024-11-19 01:02:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:38,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:38,155 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:38,163 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 (30)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:38,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:38,356 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:38,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash -504287217, now seen corresponding path program 1 times [2024-11-19 01:02:38,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:38,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961370239] [2024-11-19 01:02:38,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:38,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:38,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:38,358 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:38,358 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 (31)] Waiting until timeout for monitored process [2024-11-19 01:02:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:38,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 01:02:38,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:38,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:02:38,715 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 19 treesize of output 15 [2024-11-19 01:02:38,774 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 54 treesize of output 42 [2024-11-19 01:02:38,827 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 24 treesize of output 16 [2024-11-19 01:02:38,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-19 01:02:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-19 01:02:38,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:39,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:39,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961370239] [2024-11-19 01:02:39,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961370239] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:39,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:39,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 23 [2024-11-19 01:02:39,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739283169] [2024-11-19 01:02:39,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:39,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:02:39,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:39,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:02:39,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-11-19 01:02:39,195 INFO L87 Difference]: Start difference. First operand 1891 states and 2439 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:39,936 INFO L93 Difference]: Finished difference Result 3229 states and 4188 transitions. [2024-11-19 01:02:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 01:02:39,937 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:39,944 INFO L225 Difference]: With dead ends: 3229 [2024-11-19 01:02:39,945 INFO L226 Difference]: Without dead ends: 2231 [2024-11-19 01:02:39,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2024-11-19 01:02:39,948 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 272 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:39,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1801 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:02:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2024-11-19 01:02:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1963. [2024-11-19 01:02:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1744 states have (on average 1.2620412844036697) internal successors, (2201), 1756 states have internal predecessors, (2201), 173 states have call successors, (173), 45 states have call predecessors, (173), 45 states have return successors, (173), 161 states have call predecessors, (173), 173 states have call successors, (173) [2024-11-19 01:02:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2547 transitions. [2024-11-19 01:02:40,057 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2547 transitions. Word has length 150 [2024-11-19 01:02:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:40,057 INFO L471 AbstractCegarLoop]: Abstraction has 1963 states and 2547 transitions. [2024-11-19 01:02:40,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2547 transitions. [2024-11-19 01:02:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:40,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:40,058 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:40,064 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 (31)] Ended with exit code 0 [2024-11-19 01:02:40,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:40,259 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:40,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2092635119, now seen corresponding path program 1 times [2024-11-19 01:02:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:40,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789120923] [2024-11-19 01:02:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:40,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:40,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:40,261 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:40,262 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 (32)] Waiting until timeout for monitored process [2024-11-19 01:02:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:40,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 01:02:40,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:41,330 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 19 treesize of output 15 [2024-11-19 01:02:41,383 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 24 treesize of output 16 [2024-11-19 01:02:41,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 01:02:41,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-19 01:02:41,541 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-19 01:02:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 10 proven. 414 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 01:02:42,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:43,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789120923] [2024-11-19 01:02:43,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789120923] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:43,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:43,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2024-11-19 01:02:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404712433] [2024-11-19 01:02:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:43,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:02:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:43,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:02:43,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-11-19 01:02:43,512 INFO L87 Difference]: Start difference. First operand 1963 states and 2547 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:44,488 INFO L93 Difference]: Finished difference Result 3613 states and 4705 transitions. [2024-11-19 01:02:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:02:44,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-11-19 01:02:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:44,496 INFO L225 Difference]: With dead ends: 3613 [2024-11-19 01:02:44,496 INFO L226 Difference]: Without dead ends: 2543 [2024-11-19 01:02:44,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2024-11-19 01:02:44,498 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 357 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:44,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1046 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:02:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2024-11-19 01:02:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2075. [2024-11-19 01:02:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 1856 states have (on average 1.2720905172413792) internal successors, (2361), 1868 states have internal predecessors, (2361), 173 states have call successors, (173), 45 states have call predecessors, (173), 45 states have return successors, (173), 161 states have call predecessors, (173), 173 states have call successors, (173) [2024-11-19 01:02:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 2707 transitions. [2024-11-19 01:02:44,598 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 2707 transitions. Word has length 150 [2024-11-19 01:02:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:44,599 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 2707 transitions. [2024-11-19 01:02:44,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2707 transitions. [2024-11-19 01:02:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:02:44,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:44,601 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:44,607 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 (32)] Ended with exit code 0 [2024-11-19 01:02:44,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:44,801 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:44,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1666925493, now seen corresponding path program 1 times [2024-11-19 01:02:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841708040] [2024-11-19 01:02:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:44,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:44,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:44,803 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:44,804 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 (33)] Waiting until timeout for monitored process [2024-11-19 01:02:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:45,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:02:45,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-19 01:02:45,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:45,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841708040] [2024-11-19 01:02:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841708040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:45,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:02:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479115989] [2024-11-19 01:02:45,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:45,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:02:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:45,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:02:45,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:02:45,064 INFO L87 Difference]: Start difference. First operand 2075 states and 2707 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:02:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:45,164 INFO L93 Difference]: Finished difference Result 4002 states and 5221 transitions. [2024-11-19 01:02:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:02:45,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-11-19 01:02:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:45,169 INFO L225 Difference]: With dead ends: 4002 [2024-11-19 01:02:45,169 INFO L226 Difference]: Without dead ends: 2075 [2024-11-19 01:02:45,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 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-19 01:02:45,172 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:45,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:02:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2024-11-19 01:02:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2075. [2024-11-19 01:02:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 1856 states have (on average 1.2699353448275863) internal successors, (2357), 1868 states have internal predecessors, (2357), 173 states have call successors, (173), 45 states have call predecessors, (173), 45 states have return successors, (173), 161 states have call predecessors, (173), 173 states have call successors, (173) [2024-11-19 01:02:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 2703 transitions. [2024-11-19 01:02:45,265 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 2703 transitions. Word has length 150 [2024-11-19 01:02:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:45,266 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 2703 transitions. [2024-11-19 01:02:45,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:02:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2703 transitions. [2024-11-19 01:02:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 01:02:45,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:45,267 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:45,274 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 (33)] Ended with exit code 0 [2024-11-19 01:02:45,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:45,468 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:45,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:45,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1202490543, now seen corresponding path program 1 times [2024-11-19 01:02:45,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:45,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546000768] [2024-11-19 01:02:45,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:45,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:45,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:45,470 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:45,471 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 (34)] Waiting until timeout for monitored process [2024-11-19 01:02:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:45,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 01:02:45,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:46,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-19 01:02:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-19 01:02:46,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:46,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:46,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546000768] [2024-11-19 01:02:46,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546000768] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:46,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:46,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2024-11-19 01:02:46,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727113007] [2024-11-19 01:02:46,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:46,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:02:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:46,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:02:46,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:02:46,172 INFO L87 Difference]: Start difference. First operand 2075 states and 2703 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:46,487 INFO L93 Difference]: Finished difference Result 4606 states and 6014 transitions. [2024-11-19 01:02:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:02:46,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-19 01:02:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:46,497 INFO L225 Difference]: With dead ends: 4606 [2024-11-19 01:02:46,498 INFO L226 Difference]: Without dead ends: 2775 [2024-11-19 01:02:46,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:02:46,501 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 65 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:46,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 962 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:02:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2024-11-19 01:02:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 2481. [2024-11-19 01:02:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2262 states have (on average 1.2939876215738284) internal successors, (2927), 2274 states have internal predecessors, (2927), 173 states have call successors, (173), 45 states have call predecessors, (173), 45 states have return successors, (173), 161 states have call predecessors, (173), 173 states have call successors, (173) [2024-11-19 01:02:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3273 transitions. [2024-11-19 01:02:46,614 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3273 transitions. Word has length 152 [2024-11-19 01:02:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:46,614 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3273 transitions. [2024-11-19 01:02:46,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3273 transitions. [2024-11-19 01:02:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 01:02:46,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:46,616 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:46,625 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 (34)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:46,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:46,817 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:46,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2071408399, now seen corresponding path program 1 times [2024-11-19 01:02:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:46,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448635923] [2024-11-19 01:02:46,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:46,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:46,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:46,819 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:46,820 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 (35)] Waiting until timeout for monitored process [2024-11-19 01:02:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:47,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 01:02:47,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:47,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:02:47,507 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 69 treesize of output 53 [2024-11-19 01:02:47,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2024-11-19 01:02:47,626 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-19 01:02:47,629 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 30 treesize of output 18 [2024-11-19 01:02:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:47,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:47,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:47,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448635923] [2024-11-19 01:02:47,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448635923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:47,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:47,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 01:02:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733824606] [2024-11-19 01:02:47,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:47,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:02:47,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:47,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:02:47,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:02:47,657 INFO L87 Difference]: Start difference. First operand 2481 states and 3273 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:49,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:49,148 INFO L93 Difference]: Finished difference Result 4966 states and 6511 transitions. [2024-11-19 01:02:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 01:02:49,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-19 01:02:49,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:49,159 INFO L225 Difference]: With dead ends: 4966 [2024-11-19 01:02:49,160 INFO L226 Difference]: Without dead ends: 2789 [2024-11-19 01:02:49,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:02:49,164 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 246 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:49,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1629 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 01:02:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2024-11-19 01:02:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2751. [2024-11-19 01:02:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2500 states have (on average 1.278) internal successors, (3195), 2516 states have internal predecessors, (3195), 197 states have call successors, (197), 53 states have call predecessors, (197), 53 states have return successors, (197), 181 states have call predecessors, (197), 197 states have call successors, (197) [2024-11-19 01:02:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3589 transitions. [2024-11-19 01:02:49,353 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 3589 transitions. Word has length 152 [2024-11-19 01:02:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:49,353 INFO L471 AbstractCegarLoop]: Abstraction has 2751 states and 3589 transitions. [2024-11-19 01:02:49,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3589 transitions. [2024-11-19 01:02:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 01:02:49,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:49,356 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:49,365 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 (35)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:49,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:49,557 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:49,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:49,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1754789531, now seen corresponding path program 1 times [2024-11-19 01:02:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:49,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452463795] [2024-11-19 01:02:49,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:49,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:49,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:49,561 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:49,562 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 (36)] Waiting until timeout for monitored process [2024-11-19 01:02:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:49,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 01:02:49,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:50,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-19 01:02:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-19 01:02:50,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:50,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:50,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452463795] [2024-11-19 01:02:50,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452463795] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:50,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:50,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2024-11-19 01:02:50,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138907240] [2024-11-19 01:02:50,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:50,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:02:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:50,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:02:50,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:02:50,264 INFO L87 Difference]: Start difference. First operand 2751 states and 3589 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:50,565 INFO L93 Difference]: Finished difference Result 5608 states and 7309 transitions. [2024-11-19 01:02:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:02:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-19 01:02:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:50,572 INFO L225 Difference]: With dead ends: 5608 [2024-11-19 01:02:50,572 INFO L226 Difference]: Without dead ends: 3165 [2024-11-19 01:02:50,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:02:50,575 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 66 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:50,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 917 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:02:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2024-11-19 01:02:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 2947. [2024-11-19 01:02:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2696 states have (on average 1.2844955489614243) internal successors, (3463), 2712 states have internal predecessors, (3463), 197 states have call successors, (197), 53 states have call predecessors, (197), 53 states have return successors, (197), 181 states have call predecessors, (197), 197 states have call successors, (197) [2024-11-19 01:02:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 3857 transitions. [2024-11-19 01:02:50,698 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 3857 transitions. Word has length 152 [2024-11-19 01:02:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:50,699 INFO L471 AbstractCegarLoop]: Abstraction has 2947 states and 3857 transitions. [2024-11-19 01:02:50,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 3857 transitions. [2024-11-19 01:02:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 01:02:50,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:50,701 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:50,708 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 (36)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:50,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:50,904 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:50,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash -500890669, now seen corresponding path program 1 times [2024-11-19 01:02:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:50,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191210522] [2024-11-19 01:02:50,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:50,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:50,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:50,909 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:50,909 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 (37)] Waiting until timeout for monitored process [2024-11-19 01:02:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:51,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 01:02:51,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:51,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:02:51,440 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 54 treesize of output 42 [2024-11-19 01:02:51,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-19 01:02:51,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-19 01:02:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:51,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:51,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:51,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191210522] [2024-11-19 01:02:51,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191210522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:51,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:51,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:02:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578887360] [2024-11-19 01:02:51,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:51,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:02:51,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:51,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:02:51,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:02:51,502 INFO L87 Difference]: Start difference. First operand 2947 states and 3857 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:52,073 INFO L93 Difference]: Finished difference Result 5436 states and 7127 transitions. [2024-11-19 01:02:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:02:52,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-19 01:02:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:52,081 INFO L225 Difference]: With dead ends: 5436 [2024-11-19 01:02:52,081 INFO L226 Difference]: Without dead ends: 2805 [2024-11-19 01:02:52,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:02:52,085 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 180 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:52,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1034 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:02:52,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2024-11-19 01:02:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2781. [2024-11-19 01:02:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2544 states have (on average 1.2861635220125787) internal successors, (3272), 2558 states have internal predecessors, (3272), 185 states have call successors, (185), 51 states have call predecessors, (185), 51 states have return successors, (185), 171 states have call predecessors, (185), 185 states have call successors, (185) [2024-11-19 01:02:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3642 transitions. [2024-11-19 01:02:52,243 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3642 transitions. Word has length 152 [2024-11-19 01:02:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:52,243 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3642 transitions. [2024-11-19 01:02:52,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3642 transitions. [2024-11-19 01:02:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 01:02:52,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:52,246 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:52,253 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 (37)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:52,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:52,450 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:52,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1838577891, now seen corresponding path program 1 times [2024-11-19 01:02:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:52,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828917188] [2024-11-19 01:02:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:52,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:52,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:52,453 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:52,455 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 (38)] Waiting until timeout for monitored process [2024-11-19 01:02:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:52,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 01:02:52,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:52,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:02:53,140 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 69 treesize of output 53 [2024-11-19 01:02:53,246 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 50 treesize of output 34 [2024-11-19 01:02:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:53,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:02:53,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828917188] [2024-11-19 01:02:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828917188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:02:53,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:02:53,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:02:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876006631] [2024-11-19 01:02:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:53,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:02:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:02:53,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:02:53,273 INFO L87 Difference]: Start difference. First operand 2781 states and 3642 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:53,956 INFO L93 Difference]: Finished difference Result 5274 states and 6912 transitions. [2024-11-19 01:02:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:02:53,957 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-19 01:02:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:53,962 INFO L225 Difference]: With dead ends: 5274 [2024-11-19 01:02:53,962 INFO L226 Difference]: Without dead ends: 2809 [2024-11-19 01:02:53,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:02:53,965 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 223 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:53,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 940 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:02:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2024-11-19 01:02:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2781. [2024-11-19 01:02:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2544 states have (on average 1.2853773584905661) internal successors, (3270), 2558 states have internal predecessors, (3270), 185 states have call successors, (185), 51 states have call predecessors, (185), 51 states have return successors, (185), 171 states have call predecessors, (185), 185 states have call successors, (185) [2024-11-19 01:02:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3640 transitions. [2024-11-19 01:02:54,080 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3640 transitions. Word has length 152 [2024-11-19 01:02:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:54,080 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3640 transitions. [2024-11-19 01:02:54,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3640 transitions. [2024-11-19 01:02:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 01:02:54,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:54,082 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:54,089 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 (38)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:54,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:54,287 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:54,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:54,287 INFO L85 PathProgramCache]: Analyzing trace with hash 462244699, now seen corresponding path program 1 times [2024-11-19 01:02:54,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:54,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070571336] [2024-11-19 01:02:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:54,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:54,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:54,289 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:54,294 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 (39)] Waiting until timeout for monitored process [2024-11-19 01:02:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:54,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 01:02:54,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:54,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-19 01:02:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-19 01:02:54,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:02:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:02:54,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:02:54,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070571336] [2024-11-19 01:02:54,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070571336] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:02:54,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:02:54,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2024-11-19 01:02:54,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070982383] [2024-11-19 01:02:54,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:02:54,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:02:54,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:02:54,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:02:54,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:02:54,814 INFO L87 Difference]: Start difference. First operand 2781 states and 3640 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:02:55,113 INFO L93 Difference]: Finished difference Result 5664 states and 7411 transitions. [2024-11-19 01:02:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:02:55,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-19 01:02:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:02:55,120 INFO L225 Difference]: With dead ends: 5664 [2024-11-19 01:02:55,120 INFO L226 Difference]: Without dead ends: 3199 [2024-11-19 01:02:55,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:02:55,123 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 182 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:02:55,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 773 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:02:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2024-11-19 01:02:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 2973. [2024-11-19 01:02:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2973 states, 2736 states have (on average 1.2916666666666667) internal successors, (3534), 2750 states have internal predecessors, (3534), 185 states have call successors, (185), 51 states have call predecessors, (185), 51 states have return successors, (185), 171 states have call predecessors, (185), 185 states have call successors, (185) [2024-11-19 01:02:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 3904 transitions. [2024-11-19 01:02:55,239 INFO L78 Accepts]: Start accepts. Automaton has 2973 states and 3904 transitions. Word has length 152 [2024-11-19 01:02:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:02:55,240 INFO L471 AbstractCegarLoop]: Abstraction has 2973 states and 3904 transitions. [2024-11-19 01:02:55,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:02:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 3904 transitions. [2024-11-19 01:02:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 01:02:55,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:02:55,242 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:02:55,250 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 (39)] Forceful destruction successful, exit code 0 [2024-11-19 01:02:55,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:55,443 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:02:55,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:02:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 167239350, now seen corresponding path program 1 times [2024-11-19 01:02:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:02:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788032035] [2024-11-19 01:02:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:02:55,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:02:55,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:02:55,450 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:02:55,451 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 (40)] Waiting until timeout for monitored process [2024-11-19 01:02:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:02:55,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 01:02:55,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:02:55,799 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 19 treesize of output 15 [2024-11-19 01:02:55,825 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 24 treesize of output 16 [2024-11-19 01:02:55,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17