./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.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 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:18:14,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:18:14,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:18:14,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:18:14,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:18:14,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:18:14,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:18:14,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:18:14,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:18:14,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:18:14,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:18:14,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:18:14,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:18:14,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:18:14,750 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:18:14,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:18:14,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:18:14,753 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:18:14,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:18:14,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:18:14,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:18:14,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:18:14,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:18:14,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:18:14,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:18:14,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:18:14,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:18:14,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:18:14,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:18:14,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:18:14,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:18:14,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:18:14,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:18:14,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:18:14,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:18:14,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:18:14,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:18:14,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:18:14,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:18:14,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:18:14,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:18:14,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:18:14,759 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 -> 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d [2024-10-24 11:18:15,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:18:15,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:18:15,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:18:15,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:18:15,043 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:18:15,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2024-10-24 11:18:16,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:18:16,762 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:18:16,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2024-10-24 11:18:16,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5657b35/bd137d68ea03406fb693f9f316f17f33/FLAGebb105e32 [2024-10-24 11:18:16,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5657b35/bd137d68ea03406fb693f9f316f17f33 [2024-10-24 11:18:16,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:18:16,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:18:16,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:18:16,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:18:16,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:18:16,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:18:16" (1/1) ... [2024-10-24 11:18:16,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5003b49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:16, skipping insertion in model container [2024-10-24 11:18:16,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:18:16" (1/1) ... [2024-10-24 11:18:16,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:18:16,993 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i[916,929] [2024-10-24 11:18:17,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:18:17,079 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:18:17,088 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i[916,929] [2024-10-24 11:18:17,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:18:17,148 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:18:17,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17 WrapperNode [2024-10-24 11:18:17,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:18:17,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:18:17,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:18:17,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:18:17,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,208 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-10-24 11:18:17,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:18:17,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:18:17,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:18:17,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:18:17,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,252 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 24, 3, 72, 9]. 65 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 3, 1, 8, 1]. The 17 writes are split as follows [0, 3, 1, 10, 3]. [2024-10-24 11:18:17,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:18:17,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:18:17,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:18:17,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:18:17,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (1/1) ... [2024-10-24 11:18:17,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:18:17,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:18:17,339 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-10-24 11:18:17,343 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-10-24 11:18:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:18:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:18:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:18:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:18:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:18:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:18:17,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:18:17,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:18:17,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:18:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:18:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:18:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:18:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:18:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:18:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:18:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:18:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:18:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:18:17,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:18:17,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:18:17,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:18:17,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:18:17,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:18:17,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:18:17,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:18:17,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:18:17,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:18:17,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:18:17,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:18:17,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:18:17,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:18:17,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:18:17,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:18:17,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:18:17,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:18:17,567 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:18:17,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:18:18,050 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-24 11:18:18,053 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:18:18,093 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:18:18,093 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:18:18,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:18:18 BoogieIcfgContainer [2024-10-24 11:18:18,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:18:18,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:18:18,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:18:18,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:18:18,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:18:16" (1/3) ... [2024-10-24 11:18:18,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3535eb35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:18:18, skipping insertion in model container [2024-10-24 11:18:18,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:17" (2/3) ... [2024-10-24 11:18:18,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3535eb35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:18:18, skipping insertion in model container [2024-10-24 11:18:18,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:18:18" (3/3) ... [2024-10-24 11:18:18,103 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-57.i [2024-10-24 11:18:18,119 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:18:18,119 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:18:18,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:18:18,188 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;@2ef55947, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:18:18,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:18:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:18:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:18:18,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:18,240 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:18,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:18,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1959191061, now seen corresponding path program 1 times [2024-10-24 11:18:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:18,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453165315] [2024-10-24 11:18:18,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:18,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:18,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453165315] [2024-10-24 11:18:18,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453165315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:18,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:18,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:18:18,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986818015] [2024-10-24 11:18:18,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:18,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:18:18,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:18,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:18:18,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:18:18,731 INFO L87 Difference]: Start difference. First operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:18,789 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2024-10-24 11:18:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:18:18,792 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-10-24 11:18:18,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:18,801 INFO L225 Difference]: With dead ends: 177 [2024-10-24 11:18:18,801 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:18:18,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:18:18,811 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:18,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:18:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 11:18:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:18:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-24 11:18:18,866 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 129 [2024-10-24 11:18:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:18,867 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-24 11:18:18,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-24 11:18:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:18:18,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:18,874 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:18,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:18:18,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:18,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:18,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1634492857, now seen corresponding path program 1 times [2024-10-24 11:18:18,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:18,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650235382] [2024-10-24 11:18:18,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:19,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:19,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650235382] [2024-10-24 11:18:19,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650235382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:19,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:19,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:18:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523244227] [2024-10-24 11:18:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:19,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:18:19,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:19,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:18:19,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:19,376 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:19,441 INFO L93 Difference]: Finished difference Result 178 states and 263 transitions. [2024-10-24 11:18:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:18:19,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-10-24 11:18:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:19,446 INFO L225 Difference]: With dead ends: 178 [2024-10-24 11:18:19,448 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:18:19,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-10-24 11:18:19,451 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:19,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:18:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-24 11:18:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:18:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-24 11:18:19,477 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 129 [2024-10-24 11:18:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:19,479 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-24 11:18:19,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-24 11:18:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:18:19,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:19,484 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:19,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:18:19,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:19,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:19,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1634552439, now seen corresponding path program 1 times [2024-10-24 11:18:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:19,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895173874] [2024-10-24 11:18:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:20,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895173874] [2024-10-24 11:18:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895173874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:20,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:20,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853710501] [2024-10-24 11:18:20,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:20,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:20,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:20,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:20,063 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:20,175 INFO L93 Difference]: Finished difference Result 227 states and 334 transitions. [2024-10-24 11:18:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:20,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-10-24 11:18:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:20,177 INFO L225 Difference]: With dead ends: 227 [2024-10-24 11:18:20,177 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 11:18:20,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:20,179 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:20,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 519 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 11:18:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2024-10-24 11:18:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:18:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2024-10-24 11:18:20,190 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 129 [2024-10-24 11:18:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:20,191 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2024-10-24 11:18:20,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2024-10-24 11:18:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:18:20,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:20,193 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:20,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:18:20,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:20,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:20,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1564751439, now seen corresponding path program 1 times [2024-10-24 11:18:20,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:20,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103430720] [2024-10-24 11:18:20,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:20,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103430720] [2024-10-24 11:18:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103430720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:20,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:20,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:18:20,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764289540] [2024-10-24 11:18:20,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:20,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:18:20,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:18:20,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:18:20,343 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:20,377 INFO L93 Difference]: Finished difference Result 250 states and 368 transitions. [2024-10-24 11:18:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:18:20,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-10-24 11:18:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:20,381 INFO L225 Difference]: With dead ends: 250 [2024-10-24 11:18:20,383 INFO L226 Difference]: Without dead ends: 145 [2024-10-24 11:18:20,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:18:20,385 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 57 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:20,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 284 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-24 11:18:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 106. [2024-10-24 11:18:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:18:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-10-24 11:18:20,400 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 131 [2024-10-24 11:18:20,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:20,401 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-10-24 11:18:20,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-10-24 11:18:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:18:20,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:20,404 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:20,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:18:20,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:20,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:20,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1207188264, now seen corresponding path program 1 times [2024-10-24 11:18:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:20,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080291482] [2024-10-24 11:18:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:20,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:20,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:20,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080291482] [2024-10-24 11:18:20,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080291482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:20,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:20,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:20,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809485700] [2024-10-24 11:18:20,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:20,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:20,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:20,745 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:21,046 INFO L93 Difference]: Finished difference Result 301 states and 440 transitions. [2024-10-24 11:18:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:18:21,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 132 [2024-10-24 11:18:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:21,049 INFO L225 Difference]: With dead ends: 301 [2024-10-24 11:18:21,050 INFO L226 Difference]: Without dead ends: 196 [2024-10-24 11:18:21,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:21,052 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:21,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 385 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:18:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-24 11:18:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 148. [2024-10-24 11:18:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 109 states have internal predecessors, (142), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:18:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2024-10-24 11:18:21,076 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 132 [2024-10-24 11:18:21,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:21,076 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2024-10-24 11:18:21,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2024-10-24 11:18:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:18:21,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:21,079 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:21,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:18:21,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:21,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1329452793, now seen corresponding path program 1 times [2024-10-24 11:18:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:21,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669445046] [2024-10-24 11:18:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:21,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:21,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:21,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669445046] [2024-10-24 11:18:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669445046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:21,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:21,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485315969] [2024-10-24 11:18:21,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:21,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:21,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:21,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:21,455 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:21,589 INFO L93 Difference]: Finished difference Result 302 states and 439 transitions. [2024-10-24 11:18:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:21,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-24 11:18:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:21,591 INFO L225 Difference]: With dead ends: 302 [2024-10-24 11:18:21,591 INFO L226 Difference]: Without dead ends: 197 [2024-10-24 11:18:21,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:18:21,593 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 55 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:21,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 581 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:21,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-24 11:18:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 167. [2024-10-24 11:18:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.3359375) internal successors, (171), 128 states have internal predecessors, (171), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:18:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2024-10-24 11:18:21,612 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 136 [2024-10-24 11:18:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:21,613 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2024-10-24 11:18:21,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2024-10-24 11:18:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:18:21,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:21,615 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:21,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:18:21,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:21,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:21,616 INFO L85 PathProgramCache]: Analyzing trace with hash -628388215, now seen corresponding path program 1 times [2024-10-24 11:18:21,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:21,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755806457] [2024-10-24 11:18:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:21,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:21,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:21,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755806457] [2024-10-24 11:18:21,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755806457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:21,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:21,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:18:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010553414] [2024-10-24 11:18:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:21,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:18:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:21,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:18:21,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:21,984 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:22,111 INFO L93 Difference]: Finished difference Result 318 states and 463 transitions. [2024-10-24 11:18:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:18:22,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-24 11:18:22,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:22,113 INFO L225 Difference]: With dead ends: 318 [2024-10-24 11:18:22,113 INFO L226 Difference]: Without dead ends: 194 [2024-10-24 11:18:22,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:18:22,115 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 164 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:22,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 614 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:22,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-24 11:18:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2024-10-24 11:18:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:18:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2024-10-24 11:18:22,138 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 136 [2024-10-24 11:18:22,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:22,138 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2024-10-24 11:18:22,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2024-10-24 11:18:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 11:18:22,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:22,142 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:22,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:18:22,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:22,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash 759960216, now seen corresponding path program 1 times [2024-10-24 11:18:22,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:22,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360419722] [2024-10-24 11:18:22,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:22,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:22,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360419722] [2024-10-24 11:18:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360419722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:22,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:22,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:22,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831042289] [2024-10-24 11:18:22,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:22,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:22,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:22,826 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:22,989 INFO L93 Difference]: Finished difference Result 309 states and 447 transitions. [2024-10-24 11:18:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 139 [2024-10-24 11:18:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:22,992 INFO L225 Difference]: With dead ends: 309 [2024-10-24 11:18:22,992 INFO L226 Difference]: Without dead ends: 206 [2024-10-24 11:18:22,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:22,993 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 138 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:22,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 458 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-24 11:18:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2024-10-24 11:18:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 159 states have (on average 1.3396226415094339) internal successors, (213), 160 states have internal predecessors, (213), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:18:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 293 transitions. [2024-10-24 11:18:23,018 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 293 transitions. Word has length 139 [2024-10-24 11:18:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:23,019 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 293 transitions. [2024-10-24 11:18:23,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 293 transitions. [2024-10-24 11:18:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 11:18:23,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:23,021 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:23,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:18:23,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:23,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1182662042, now seen corresponding path program 1 times [2024-10-24 11:18:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:23,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764476047] [2024-10-24 11:18:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:23,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:23,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764476047] [2024-10-24 11:18:23,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764476047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:23,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:23,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:23,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452325462] [2024-10-24 11:18:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:23,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:23,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:23,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:23,324 INFO L87 Difference]: Start difference. First operand 203 states and 293 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:23,435 INFO L93 Difference]: Finished difference Result 454 states and 650 transitions. [2024-10-24 11:18:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:23,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-24 11:18:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:23,440 INFO L225 Difference]: With dead ends: 454 [2024-10-24 11:18:23,440 INFO L226 Difference]: Without dead ends: 294 [2024-10-24 11:18:23,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-10-24 11:18:23,441 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 42 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:23,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 453 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-24 11:18:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2024-10-24 11:18:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 239 states have (on average 1.3389121338912133) internal successors, (320), 242 states have internal predecessors, (320), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:18:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 408 transitions. [2024-10-24 11:18:23,463 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 408 transitions. Word has length 139 [2024-10-24 11:18:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:23,463 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 408 transitions. [2024-10-24 11:18:23,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 408 transitions. [2024-10-24 11:18:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 11:18:23,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:23,465 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:23,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:18:23,465 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:23,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:23,465 INFO L85 PathProgramCache]: Analyzing trace with hash 789635032, now seen corresponding path program 1 times [2024-10-24 11:18:23,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:23,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492122976] [2024-10-24 11:18:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:23,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:25,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:25,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492122976] [2024-10-24 11:18:25,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492122976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:25,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:25,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:25,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81759317] [2024-10-24 11:18:25,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:25,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:25,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:25,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:25,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:25,292 INFO L87 Difference]: Start difference. First operand 290 states and 408 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:25,539 INFO L93 Difference]: Finished difference Result 663 states and 925 transitions. [2024-10-24 11:18:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:25,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-24 11:18:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:25,546 INFO L225 Difference]: With dead ends: 663 [2024-10-24 11:18:25,546 INFO L226 Difference]: Without dead ends: 420 [2024-10-24 11:18:25,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:18:25,547 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 59 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:25,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 633 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:18:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-24 11:18:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2024-10-24 11:18:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 350 states have (on average 1.322857142857143) internal successors, (463), 356 states have internal predecessors, (463), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 11:18:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 575 transitions. [2024-10-24 11:18:25,583 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 575 transitions. Word has length 139 [2024-10-24 11:18:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:25,583 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 575 transitions. [2024-10-24 11:18:25,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 575 transitions. [2024-10-24 11:18:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:18:25,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:25,585 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:25,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:18:25,586 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:25,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1170363721, now seen corresponding path program 1 times [2024-10-24 11:18:25,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556521639] [2024-10-24 11:18:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:25,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556521639] [2024-10-24 11:18:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556521639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:25,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:25,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:25,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692808468] [2024-10-24 11:18:25,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:25,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:25,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:25,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:25,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:25,816 INFO L87 Difference]: Start difference. First operand 417 states and 575 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:25,932 INFO L93 Difference]: Finished difference Result 1027 states and 1421 transitions. [2024-10-24 11:18:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:25,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-24 11:18:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:25,936 INFO L225 Difference]: With dead ends: 1027 [2024-10-24 11:18:25,936 INFO L226 Difference]: Without dead ends: 657 [2024-10-24 11:18:25,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:25,938 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 77 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:25,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 499 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-24 11:18:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 441. [2024-10-24 11:18:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 374 states have (on average 1.3315508021390374) internal successors, (498), 380 states have internal predecessors, (498), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 11:18:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 610 transitions. [2024-10-24 11:18:25,976 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 610 transitions. Word has length 140 [2024-10-24 11:18:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:25,978 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 610 transitions. [2024-10-24 11:18:25,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 610 transitions. [2024-10-24 11:18:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:18:25,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:25,980 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:25,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:18:25,981 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:25,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1679836811, now seen corresponding path program 1 times [2024-10-24 11:18:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:25,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781797839] [2024-10-24 11:18:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:25,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:26,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:26,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781797839] [2024-10-24 11:18:26,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781797839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:26,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:26,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023095563] [2024-10-24 11:18:26,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:26,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:26,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:26,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:26,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:26,375 INFO L87 Difference]: Start difference. First operand 441 states and 610 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:26,518 INFO L93 Difference]: Finished difference Result 839 states and 1160 transitions. [2024-10-24 11:18:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:26,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-10-24 11:18:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:26,523 INFO L225 Difference]: With dead ends: 839 [2024-10-24 11:18:26,523 INFO L226 Difference]: Without dead ends: 445 [2024-10-24 11:18:26,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:26,525 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 112 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:26,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 484 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-24 11:18:26,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 441. [2024-10-24 11:18:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 374 states have (on average 1.3288770053475936) internal successors, (497), 380 states have internal predecessors, (497), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 11:18:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 609 transitions. [2024-10-24 11:18:26,566 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 609 transitions. Word has length 140 [2024-10-24 11:18:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:26,566 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 609 transitions. [2024-10-24 11:18:26,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 609 transitions. [2024-10-24 11:18:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:18:26,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:26,569 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:26,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:18:26,569 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:26,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:26,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2072863821, now seen corresponding path program 1 times [2024-10-24 11:18:26,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:26,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412399230] [2024-10-24 11:18:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:26,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:26,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412399230] [2024-10-24 11:18:26,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412399230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:26,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:26,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741875529] [2024-10-24 11:18:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:26,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:26,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:26,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:26,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:26,856 INFO L87 Difference]: Start difference. First operand 441 states and 609 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:26,955 INFO L93 Difference]: Finished difference Result 799 states and 1101 transitions. [2024-10-24 11:18:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:26,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-24 11:18:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:26,958 INFO L225 Difference]: With dead ends: 799 [2024-10-24 11:18:26,958 INFO L226 Difference]: Without dead ends: 372 [2024-10-24 11:18:26,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-10-24 11:18:26,960 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 95 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:26,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 382 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-24 11:18:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 346. [2024-10-24 11:18:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 285 states have (on average 1.2982456140350878) internal successors, (370), 288 states have internal predecessors, (370), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:18:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 470 transitions. [2024-10-24 11:18:26,986 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 470 transitions. Word has length 140 [2024-10-24 11:18:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:26,986 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 470 transitions. [2024-10-24 11:18:26,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 470 transitions. [2024-10-24 11:18:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:18:26,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:26,988 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:26,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:18:26,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:26,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash -293633417, now seen corresponding path program 1 times [2024-10-24 11:18:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:26,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564343033] [2024-10-24 11:18:26,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:26,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:18:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:18:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:18:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:18:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:18:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:18:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:18:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:27,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:27,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564343033] [2024-10-24 11:18:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564343033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:27,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704572035] [2024-10-24 11:18:27,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:27,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:27,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:27,356 INFO L87 Difference]: Start difference. First operand 346 states and 470 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:27,524 INFO L93 Difference]: Finished difference Result 703 states and 949 transitions. [2024-10-24 11:18:27,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:18:27,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-10-24 11:18:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:27,528 INFO L225 Difference]: With dead ends: 703 [2024-10-24 11:18:27,528 INFO L226 Difference]: Without dead ends: 404 [2024-10-24 11:18:27,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:27,531 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 125 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:27,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 537 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-24 11:18:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 351. [2024-10-24 11:18:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 289 states have (on average 1.2941176470588236) internal successors, (374), 292 states have internal predecessors, (374), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:18:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 474 transitions. [2024-10-24 11:18:27,571 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 474 transitions. Word has length 140 [2024-10-24 11:18:27,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:27,572 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 474 transitions. [2024-10-24 11:18:27,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 474 transitions. [2024-10-24 11:18:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 11:18:27,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:27,574 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:27,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:18:27,574 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:27,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1089595767, now seen corresponding path program 1 times [2024-10-24 11:18:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:27,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3712406] [2024-10-24 11:18:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:27,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:18:27,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:18:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:18:27,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:18:27,883 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:18:27,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:18:27,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:18:27,889 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:28,001 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:18:28,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:18:28 BoogieIcfgContainer [2024-10-24 11:18:28,005 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:18:28,006 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:18:28,006 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:18:28,006 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:18:28,007 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:18:18" (3/4) ... [2024-10-24 11:18:28,008 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:18:28,009 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:18:28,010 INFO L158 Benchmark]: Toolchain (without parser) took 11217.78ms. Allocated memory was 161.5MB in the beginning and 488.6MB in the end (delta: 327.2MB). Free memory was 111.2MB in the beginning and 351.5MB in the end (delta: -240.3MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2024-10-24 11:18:28,011 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 161.5MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:18:28,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.44ms. Allocated memory is still 161.5MB. Free memory was 111.2MB in the beginning and 93.1MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:18:28,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.83ms. Allocated memory is still 161.5MB. Free memory was 92.7MB in the beginning and 89.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:18:28,011 INFO L158 Benchmark]: Boogie Preprocessor took 86.29ms. Allocated memory is still 161.5MB. Free memory was 89.3MB in the beginning and 85.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:18:28,012 INFO L158 Benchmark]: RCFGBuilder took 793.97ms. Allocated memory is still 161.5MB. Free memory was 84.8MB in the beginning and 50.1MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 11:18:28,012 INFO L158 Benchmark]: TraceAbstraction took 9908.74ms. Allocated memory was 161.5MB in the beginning and 488.6MB in the end (delta: 327.2MB). Free memory was 49.5MB in the beginning and 351.5MB in the end (delta: -302.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-10-24 11:18:28,012 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 488.6MB. Free memory is still 351.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:18:28,014 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.10ms. Allocated memory is still 161.5MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.44ms. Allocated memory is still 161.5MB. Free memory was 111.2MB in the beginning and 93.1MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.83ms. Allocated memory is still 161.5MB. Free memory was 92.7MB in the beginning and 89.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.29ms. Allocated memory is still 161.5MB. Free memory was 89.3MB in the beginning and 85.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 793.97ms. Allocated memory is still 161.5MB. Free memory was 84.8MB in the beginning and 50.1MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9908.74ms. Allocated memory was 161.5MB in the beginning and 488.6MB in the end (delta: 327.2MB). Free memory was 49.5MB in the beginning and 351.5MB in the end (delta: -302.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 488.6MB. Free memory is still 351.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 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L25-L27] float float_Array_0[1] = { 63.5 }; [L25-L27] float float_Array_0[1] = { 63.5 }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L28-L30] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1 }; [L34] signed char last_1_signed_char_Array_0_1__0__0_ = 64; [L35] signed char last_1_signed_char_Array_0_0__1__1_ = -64; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L96] EXPR signed_char_Array_0[1][0][0] [L96] last_1_signed_char_Array_0_1__0__0_ = signed_char_Array_0[1][0][0] [L97] EXPR signed_char_Array_0[0][1][1] [L97] last_1_signed_char_Array_0_0__1__1_ = signed_char_Array_0[0][1][1] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L73] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L76] signed_char_Array_0[0][0][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[0][0][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[0][0][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[0][0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[0][0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L79] signed_char_Array_0[0][1][0] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L82] signed_char_Array_0[1][1][0] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1][1][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1][1][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR signed_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[1][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[1][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L85] signed_char_Array_0[0][0][1] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0][0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] EXPR signed_char_Array_0[0][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L88] signed_char_Array_0[1][0][1] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] EXPR signed_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L91] signed_char_Array_0[1][1][1] = __VERIFIER_nondet_char() [L92] EXPR signed_char_Array_0[1][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[1][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[1][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] EXPR signed_char_Array_0[1][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[1][1][1] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[1][1][1] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L39] EXPR BOOL_unsigned_char_Array_0[0] [L39] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L40] COND TRUE ! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_) [L41] EXPR BOOL_unsigned_char_Array_0[2] [L41] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-255] [L41] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L41] COND TRUE (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && stepLocal_0 [L42] signed_long_int_Array_0[0] = ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] EXPR signed_char_Array_0[1][1][1] [L49] EXPR signed_char_Array_0[1][0][1] [L49] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) [L49] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L49] signed long int stepLocal_3 = (signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))); [L50] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L50] COND TRUE signed_char_Array_0[0][0][0] < stepLocal_3 [L51] EXPR signed_char_Array_0[1][0][1] [L51] EXPR signed_char_Array_0[0][1][0] [L51] signed_char_Array_0[0][1][1] = ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]) [L55] float_Array_0[0] = 128.91f [L56] EXPR signed_char_Array_0[0][1][1] [L56] EXPR signed_long_int_Array_0[0] [L56] unsigned char stepLocal_2 = signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0]; [L57] EXPR BOOL_unsigned_char_Array_0[1] [L57] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[1]; [L58] stepLocal_1 && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_2=0] [L58] stepLocal_1 && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L58] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[2]) [L63] EXPR signed_char_Array_0[0][0][0] [L63] EXPR signed_char_Array_0[0][1][0] [L63] signed_char_Array_0[1][0][0] = (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) [L100] EXPR BOOL_unsigned_char_Array_0[2] [L100] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] [L100] EXPR BOOL_unsigned_char_Array_0[0] [L100] EXPR (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) [L100] EXPR signed_long_int_Array_0[0] [L100] EXPR ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) [L100] EXPR BOOL_unsigned_char_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))) [L100] EXPR signed_char_Array_0[1][0][0] [L100] EXPR signed_char_Array_0[0][0][0] [L100] EXPR signed_char_Array_0[0][1][0] [L100] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) [L100] EXPR signed_char_Array_0[0][0][0] [L100] EXPR signed_char_Array_0[1][1][1] [L100] EXPR signed_char_Array_0[1][0][1] [L100] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) [L100] EXPR ((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) [L100] EXPR signed_char_Array_0[0][1][1] [L100] EXPR signed_char_Array_0[1][0][1] [L100] EXPR signed_char_Array_0[0][1][0] [L100] EXPR (signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) [L100] EXPR float_Array_0[0] [L100] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L100-L101] return ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? (((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : (signed_long_int_Array_0[0] == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] || (signed_char_Array_0[0][1][1] == signed_long_int_Array_0[0])) ? (signed_char_Array_0[1][0][0] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))) : 1) : (signed_char_Array_0[1][0][0] == ((signed char) (signed_char_Array_0[0][0][0] - signed_char_Array_0[0][1][0]))))) && ((signed_char_Array_0[0][0][0] < ((signed_char_Array_0[1][1][1] + signed_char_Array_0[1][0][1]) - ((((64) > (signed_char_Array_0[0][1][0])) ? (64) : (signed_char_Array_0[0][1][0]))))) ? (signed_char_Array_0[0][1][1] == ((signed char) ((64 - signed_char_Array_0[1][0][1]) - signed_char_Array_0[0][1][0]))) : (signed_char_Array_0[0][1][1] == ((signed char) ((((signed_char_Array_0[1][1][0]) < (signed_char_Array_0[0][0][1])) ? (signed_char_Array_0[1][1][0]) : (signed_char_Array_0[0][0][1]))))))) && (float_Array_0[0] == ((float) 128.91f)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 15, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1094 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1091 mSDsluCounter, 6320 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4469 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1078 IncrementalHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 1851 mSDtfsCounter, 1078 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 625 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=11, InterpolantAutomatonStates: 75, 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, 14 MinimizatonAttempts, 507 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2041 NumberOfCodeBlocks, 2041 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1885 ConstructedInterpolants, 0 QuantifiedInterpolants, 4765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 8568/8568 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:18:28,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.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 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:18:30,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:18:30,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:18:30,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:18:30,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:18:30,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:18:30,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:18:30,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:18:30,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:18:30,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:18:30,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:18:30,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:18:30,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:18:30,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:18:30,402 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:18:30,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:18:30,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:18:30,403 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:18:30,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:18:30,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:18:30,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:18:30,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:18:30,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:18:30,408 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:18:30,408 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:18:30,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:18:30,408 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:18:30,408 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:18:30,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:18:30,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:18:30,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:18:30,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:18:30,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:18:30,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:18:30,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:18:30,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:18:30,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:18:30,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:18:30,411 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:18:30,412 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:18:30,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:18:30,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:18:30,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:18:30,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:18:30,413 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:18:30,414 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 -> 523cdc555ae18a7121d858cb3ce401c3fbc4c545022234654bee429dbd299e9d [2024-10-24 11:18:30,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:18:30,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:18:30,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:18:30,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:18:30,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:18:30,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2024-10-24 11:18:32,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:18:32,571 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:18:32,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i [2024-10-24 11:18:32,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f537ee861/b83e54cfc38f45929a085c71d3be2973/FLAG139b57242 [2024-10-24 11:18:32,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f537ee861/b83e54cfc38f45929a085c71d3be2973 [2024-10-24 11:18:32,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:18:32,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:18:32,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:18:32,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:18:32,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:18:32,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:18:32" (1/1) ... [2024-10-24 11:18:32,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b38877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:32, skipping insertion in model container [2024-10-24 11:18:32,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:18:32" (1/1) ... [2024-10-24 11:18:32,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:18:32,849 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i[916,929] [2024-10-24 11:18:32,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:18:32,954 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:18:32,968 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-57.i[916,929] [2024-10-24 11:18:33,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:18:33,057 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:18:33,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33 WrapperNode [2024-10-24 11:18:33,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:18:33,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:18:33,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:18:33,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:18:33,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,126 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2024-10-24 11:18:33,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:18:33,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:18:33,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:18:33,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:18:33,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,180 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 24, 3, 72, 9]. 65 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 3, 1, 8, 1]. The 17 writes are split as follows [0, 3, 1, 10, 3]. [2024-10-24 11:18:33,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:18:33,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:18:33,231 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:18:33,231 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:18:33,232 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (1/1) ... [2024-10-24 11:18:33,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:18:33,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:18:33,263 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-10-24 11:18:33,269 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-10-24 11:18:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:18:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:18:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:18:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:18:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:18:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:18:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:18:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:18:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:18:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:18:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:18:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:18:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:18:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:18:33,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:18:33,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 11:18:33,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:18:33,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:18:33,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:18:33,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:18:33,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:18:33,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:18:33,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:18:33,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:18:33,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:18:33,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:18:33,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:18:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 11:18:33,500 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:18:33,502 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:18:34,033 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-24 11:18:34,033 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:18:34,085 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:18:34,087 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:18:34,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:18:34 BoogieIcfgContainer [2024-10-24 11:18:34,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:18:34,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:18:34,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:18:34,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:18:34,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:18:32" (1/3) ... [2024-10-24 11:18:34,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc677f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:18:34, skipping insertion in model container [2024-10-24 11:18:34,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:33" (2/3) ... [2024-10-24 11:18:34,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc677f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:18:34, skipping insertion in model container [2024-10-24 11:18:34,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:18:34" (3/3) ... [2024-10-24 11:18:34,097 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-57.i [2024-10-24 11:18:34,114 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:18:34,114 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:18:34,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:18:34,187 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;@71a3b71b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:18:34,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:18:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:18:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:18:34,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:34,208 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:34,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:34,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1959191061, now seen corresponding path program 1 times [2024-10-24 11:18:34,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:34,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131482534] [2024-10-24 11:18:34,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:34,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:34,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:34,235 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-10-24 11:18:34,236 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-10-24 11:18:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:34,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:18:34,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-24 11:18:34,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:34,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:34,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131482534] [2024-10-24 11:18:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131482534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:34,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:18:34,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282778452] [2024-10-24 11:18:34,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:34,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:18:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:18:34,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:18:34,596 INFO L87 Difference]: Start difference. First operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:34,656 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2024-10-24 11:18:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:18:34,660 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-10-24 11:18:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:34,667 INFO L225 Difference]: With dead ends: 177 [2024-10-24 11:18:34,668 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:18:34,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:18:34,677 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:34,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:18:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 11:18:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:18:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-24 11:18:34,736 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 129 [2024-10-24 11:18:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:34,737 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-24 11:18:34,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 11:18:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-24 11:18:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:18:34,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:34,743 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:34,750 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-10-24 11:18:34,944 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-10-24 11:18:34,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:34,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1634492857, now seen corresponding path program 1 times [2024-10-24 11:18:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:34,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218303766] [2024-10-24 11:18:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:34,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:34,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:34,949 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-10-24 11:18:34,950 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-10-24 11:18:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:35,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:18:35,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:35,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:35,317 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 41 treesize of output 17 [2024-10-24 11:18:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:35,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:35,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:35,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218303766] [2024-10-24 11:18:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218303766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:35,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:35,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:18:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933764228] [2024-10-24 11:18:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:35,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:18:35,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:35,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:18:35,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:35,943 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:36,331 INFO L93 Difference]: Finished difference Result 263 states and 389 transitions. [2024-10-24 11:18:36,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:18:36,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-10-24 11:18:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:36,336 INFO L225 Difference]: With dead ends: 263 [2024-10-24 11:18:36,336 INFO L226 Difference]: Without dead ends: 176 [2024-10-24 11:18:36,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:36,340 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 97 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:36,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 304 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:18:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-24 11:18:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 146. [2024-10-24 11:18:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 107 states have internal predecessors, (142), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:18:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 214 transitions. [2024-10-24 11:18:36,369 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 214 transitions. Word has length 129 [2024-10-24 11:18:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:36,370 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 214 transitions. [2024-10-24 11:18:36,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 214 transitions. [2024-10-24 11:18:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:18:36,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:36,376 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:36,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:36,577 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-10-24 11:18:36,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:36,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1329512375, now seen corresponding path program 1 times [2024-10-24 11:18:36,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:36,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104555922] [2024-10-24 11:18:36,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:36,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:36,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:36,582 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-10-24 11:18:36,583 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-10-24 11:18:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:36,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:18:36,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-24 11:18:37,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:18:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:37,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:37,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104555922] [2024-10-24 11:18:37,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104555922] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:18:37,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:18:37,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-24 11:18:37,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195227028] [2024-10-24 11:18:37,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:37,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:37,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:37,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:37,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:18:37,392 INFO L87 Difference]: Start difference. First operand 146 states and 214 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:37,552 INFO L93 Difference]: Finished difference Result 309 states and 455 transitions. [2024-10-24 11:18:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:37,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-24 11:18:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:37,557 INFO L225 Difference]: With dead ends: 309 [2024-10-24 11:18:37,557 INFO L226 Difference]: Without dead ends: 220 [2024-10-24 11:18:37,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:18:37,561 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 142 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:37,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 357 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-24 11:18:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2024-10-24 11:18:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 173 states have (on average 1.3872832369942196) internal successors, (240), 174 states have internal predecessors, (240), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:18:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2024-10-24 11:18:37,595 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 136 [2024-10-24 11:18:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:37,596 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2024-10-24 11:18:37,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2024-10-24 11:18:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:18:37,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:37,598 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:37,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:37,798 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-10-24 11:18:37,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:37,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash 971310215, now seen corresponding path program 1 times [2024-10-24 11:18:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065199423] [2024-10-24 11:18:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:37,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:37,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:37,804 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-10-24 11:18:37,805 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-10-24 11:18:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:37,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:18:37,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:38,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:38,030 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 41 treesize of output 17 [2024-10-24 11:18:38,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-10-24 11:18:38,508 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 11:18:38,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2024-10-24 11:18:38,655 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 91 treesize of output 79 [2024-10-24 11:18:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:38,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:38,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:38,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065199423] [2024-10-24 11:18:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065199423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:38,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:18:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963105135] [2024-10-24 11:18:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:38,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:18:38,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:38,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:18:38,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:18:38,696 INFO L87 Difference]: Start difference. First operand 217 states and 320 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:39,257 INFO L93 Difference]: Finished difference Result 417 states and 618 transitions. [2024-10-24 11:18:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:18:39,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-24 11:18:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:39,262 INFO L225 Difference]: With dead ends: 417 [2024-10-24 11:18:39,262 INFO L226 Difference]: Without dead ends: 275 [2024-10-24 11:18:39,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:18:39,264 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 132 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:39,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 584 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:18:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-24 11:18:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 231. [2024-10-24 11:18:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 187 states have (on average 1.3903743315508021) internal successors, (260), 188 states have internal predecessors, (260), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:18:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 340 transitions. [2024-10-24 11:18:39,317 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 340 transitions. Word has length 136 [2024-10-24 11:18:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 340 transitions. [2024-10-24 11:18:39,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 340 transitions. [2024-10-24 11:18:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 11:18:39,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:39,323 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:39,336 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 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:39,524 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-10-24 11:18:39,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:39,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1182602460, now seen corresponding path program 1 times [2024-10-24 11:18:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:39,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975036691] [2024-10-24 11:18:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:39,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:39,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:39,529 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-10-24 11:18:39,530 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-10-24 11:18:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:39,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:18:39,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:39,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:39,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:39,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975036691] [2024-10-24 11:18:39,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975036691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:39,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:39,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:39,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370491308] [2024-10-24 11:18:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:39,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:39,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:39,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:39,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:39,782 INFO L87 Difference]: Start difference. First operand 231 states and 340 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:39,918 INFO L93 Difference]: Finished difference Result 491 states and 715 transitions. [2024-10-24 11:18:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:18:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-24 11:18:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:39,923 INFO L225 Difference]: With dead ends: 491 [2024-10-24 11:18:39,923 INFO L226 Difference]: Without dead ends: 325 [2024-10-24 11:18:39,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:39,926 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 38 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:39,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 443 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-24 11:18:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2024-10-24 11:18:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 270 states have (on average 1.3666666666666667) internal successors, (369), 273 states have internal predecessors, (369), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:18:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 457 transitions. [2024-10-24 11:18:39,955 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 457 transitions. Word has length 139 [2024-10-24 11:18:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:39,956 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 457 transitions. [2024-10-24 11:18:39,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 457 transitions. [2024-10-24 11:18:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 11:18:39,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:39,958 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:39,966 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-10-24 11:18:40,159 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-10-24 11:18:40,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:40,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash 789575450, now seen corresponding path program 1 times [2024-10-24 11:18:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430491670] [2024-10-24 11:18:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:40,164 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-10-24 11:18:40,166 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-10-24 11:18:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:40,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:18:40,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:40,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:40,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:40,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430491670] [2024-10-24 11:18:40,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430491670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:40,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:40,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:18:40,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869583797] [2024-10-24 11:18:40,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:40,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:18:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:18:40,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:40,363 INFO L87 Difference]: Start difference. First operand 321 states and 457 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:40,410 INFO L93 Difference]: Finished difference Result 542 states and 774 transitions. [2024-10-24 11:18:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:18:40,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-24 11:18:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:40,418 INFO L225 Difference]: With dead ends: 542 [2024-10-24 11:18:40,418 INFO L226 Difference]: Without dead ends: 333 [2024-10-24 11:18:40,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 136 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-10-24 11:18:40,419 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:40,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-24 11:18:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2024-10-24 11:18:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 278 states have (on average 1.356115107913669) internal successors, (377), 281 states have internal predecessors, (377), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:18:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 465 transitions. [2024-10-24 11:18:40,461 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 465 transitions. Word has length 139 [2024-10-24 11:18:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:40,462 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 465 transitions. [2024-10-24 11:18:40,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 465 transitions. [2024-10-24 11:18:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 11:18:40,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:40,465 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:40,473 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-10-24 11:18:40,666 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-10-24 11:18:40,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:40,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 789635032, now seen corresponding path program 1 times [2024-10-24 11:18:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:40,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824100968] [2024-10-24 11:18:40,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:40,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:40,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:40,669 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-10-24 11:18:40,670 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-10-24 11:18:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:40,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 11:18:40,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:40,916 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 8 treesize of output 1 [2024-10-24 11:18:40,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-24 11:18:41,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:41,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 31 [2024-10-24 11:18:41,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:41,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 31 [2024-10-24 11:18:41,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:41,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 31 [2024-10-24 11:18:41,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:41,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 41 [2024-10-24 11:18:42,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:42,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 78 [2024-10-24 11:18:42,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:42,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 99 [2024-10-24 11:18:42,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:42,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 182 treesize of output 88 [2024-10-24 11:18:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 57 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-24 11:18:42,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:18:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:42,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:42,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824100968] [2024-10-24 11:18:42,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824100968] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:18:42,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:18:42,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 21 [2024-10-24 11:18:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861435996] [2024-10-24 11:18:42,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:42,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:42,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:42,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:18:42,987 INFO L87 Difference]: Start difference. First operand 329 states and 465 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:43,270 INFO L93 Difference]: Finished difference Result 621 states and 876 transitions. [2024-10-24 11:18:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:43,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-24 11:18:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:43,273 INFO L225 Difference]: With dead ends: 621 [2024-10-24 11:18:43,273 INFO L226 Difference]: Without dead ends: 404 [2024-10-24 11:18:43,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:18:43,275 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 60 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:43,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 637 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:18:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-24 11:18:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2024-10-24 11:18:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 340 states have (on average 1.3470588235294119) internal successors, (458), 344 states have internal predecessors, (458), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 11:18:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 562 transitions. [2024-10-24 11:18:43,305 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 562 transitions. Word has length 139 [2024-10-24 11:18:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:43,305 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 562 transitions. [2024-10-24 11:18:43,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 562 transitions. [2024-10-24 11:18:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:18:43,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:43,309 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:43,320 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:43,510 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-10-24 11:18:43,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:43,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:43,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1170363721, now seen corresponding path program 1 times [2024-10-24 11:18:43,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:43,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900314736] [2024-10-24 11:18:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:43,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:43,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:43,514 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-10-24 11:18:43,516 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-10-24 11:18:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:43,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:18:43,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:43,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-24 11:18:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:43,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:43,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900314736] [2024-10-24 11:18:43,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900314736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:43,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:43,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:43,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639989487] [2024-10-24 11:18:43,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:43,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:43,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:43,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:43,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:43,743 INFO L87 Difference]: Start difference. First operand 401 states and 562 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:44,097 INFO L93 Difference]: Finished difference Result 974 states and 1372 transitions. [2024-10-24 11:18:44,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:44,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-24 11:18:44,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:44,102 INFO L225 Difference]: With dead ends: 974 [2024-10-24 11:18:44,102 INFO L226 Difference]: Without dead ends: 676 [2024-10-24 11:18:44,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:44,103 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 79 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:44,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 509 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:18:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-24 11:18:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 441. [2024-10-24 11:18:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 380 states have (on average 1.3578947368421053) internal successors, (516), 384 states have internal predecessors, (516), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 11:18:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 620 transitions. [2024-10-24 11:18:44,133 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 620 transitions. Word has length 140 [2024-10-24 11:18:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:44,133 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 620 transitions. [2024-10-24 11:18:44,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 620 transitions. [2024-10-24 11:18:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:18:44,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:44,135 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:44,144 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 (9)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:44,336 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-10-24 11:18:44,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:44,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1679836811, now seen corresponding path program 1 times [2024-10-24 11:18:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:44,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639778916] [2024-10-24 11:18:44,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:44,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:44,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:44,340 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-10-24 11:18:44,342 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-10-24 11:18:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:44,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:18:44,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:44,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:44,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639778916] [2024-10-24 11:18:44,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639778916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:44,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:44,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788097146] [2024-10-24 11:18:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:44,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:44,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:44,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:44,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:44,547 INFO L87 Difference]: Start difference. First operand 441 states and 620 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:44,703 INFO L93 Difference]: Finished difference Result 870 states and 1223 transitions. [2024-10-24 11:18:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:18:44,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-24 11:18:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:44,708 INFO L225 Difference]: With dead ends: 870 [2024-10-24 11:18:44,709 INFO L226 Difference]: Without dead ends: 555 [2024-10-24 11:18:44,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:44,711 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 73 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:44,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 798 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-24 11:18:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 477. [2024-10-24 11:18:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 416 states have (on average 1.3557692307692308) internal successors, (564), 420 states have internal predecessors, (564), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 11:18:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 668 transitions. [2024-10-24 11:18:44,736 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 668 transitions. Word has length 140 [2024-10-24 11:18:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:44,737 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 668 transitions. [2024-10-24 11:18:44,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 668 transitions. [2024-10-24 11:18:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:18:44,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:44,738 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:44,747 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-10-24 11:18:44,939 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-10-24 11:18:44,940 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:44,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1604013235, now seen corresponding path program 1 times [2024-10-24 11:18:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:44,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293798622] [2024-10-24 11:18:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:44,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:44,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:44,944 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-10-24 11:18:44,945 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-10-24 11:18:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:45,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:18:45,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-24 11:18:45,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:18:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:45,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:45,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293798622] [2024-10-24 11:18:45,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293798622] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:18:45,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:18:45,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-24 11:18:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873361482] [2024-10-24 11:18:45,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:45,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:45,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:45,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:18:45,550 INFO L87 Difference]: Start difference. First operand 477 states and 668 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:45,683 INFO L93 Difference]: Finished difference Result 799 states and 1119 transitions. [2024-10-24 11:18:45,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:45,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-24 11:18:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:45,687 INFO L225 Difference]: With dead ends: 799 [2024-10-24 11:18:45,687 INFO L226 Difference]: Without dead ends: 481 [2024-10-24 11:18:45,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:18:45,688 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 116 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:45,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 377 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-24 11:18:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 477. [2024-10-24 11:18:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 416 states have (on average 1.3533653846153846) internal successors, (563), 420 states have internal predecessors, (563), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 11:18:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 667 transitions. [2024-10-24 11:18:45,714 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 667 transitions. Word has length 140 [2024-10-24 11:18:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:45,714 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 667 transitions. [2024-10-24 11:18:45,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 667 transitions. [2024-10-24 11:18:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:18:45,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:45,716 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:45,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 11:18:45,917 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-10-24 11:18:45,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:45,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1210986225, now seen corresponding path program 1 times [2024-10-24 11:18:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:45,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113457721] [2024-10-24 11:18:45,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:45,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-10-24 11:18:45,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:45,922 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-10-24 11:18:45,923 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-10-24 11:18:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:46,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:18:46,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:46,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:46,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113457721] [2024-10-24 11:18:46,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113457721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:46,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:46,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:46,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397285787] [2024-10-24 11:18:46,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:46,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:46,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:46,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:46,153 INFO L87 Difference]: Start difference. First operand 477 states and 667 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:46,287 INFO L93 Difference]: Finished difference Result 807 states and 1122 transitions. [2024-10-24 11:18:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:46,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-24 11:18:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:46,290 INFO L225 Difference]: With dead ends: 807 [2024-10-24 11:18:46,290 INFO L226 Difference]: Without dead ends: 489 [2024-10-24 11:18:46,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:46,293 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 51 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:46,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 517 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-24 11:18:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 461. [2024-10-24 11:18:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 400 states have (on average 1.345) internal successors, (538), 403 states have internal predecessors, (538), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:18:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 638 transitions. [2024-10-24 11:18:46,336 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 638 transitions. Word has length 140 [2024-10-24 11:18:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:46,337 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 638 transitions. [2024-10-24 11:18:46,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 638 transitions. [2024-10-24 11:18:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:18:46,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:46,339 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:46,346 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-10-24 11:18:46,540 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-10-24 11:18:46,540 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:46,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:46,540 INFO L85 PathProgramCache]: Analyzing trace with hash -293633417, now seen corresponding path program 1 times [2024-10-24 11:18:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:46,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146249247] [2024-10-24 11:18:46,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:46,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:46,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:46,542 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-10-24 11:18:46,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 11:18:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:46,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:18:46,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-24 11:18:46,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:18:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:47,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:47,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146249247] [2024-10-24 11:18:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146249247] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:18:47,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:18:47,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-24 11:18:47,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820685697] [2024-10-24 11:18:47,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:47,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:47,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:18:47,080 INFO L87 Difference]: Start difference. First operand 461 states and 638 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:47,225 INFO L93 Difference]: Finished difference Result 842 states and 1160 transitions. [2024-10-24 11:18:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-24 11:18:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:47,229 INFO L225 Difference]: With dead ends: 842 [2024-10-24 11:18:47,229 INFO L226 Difference]: Without dead ends: 526 [2024-10-24 11:18:47,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:18:47,230 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 69 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:47,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 518 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-24 11:18:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 448. [2024-10-24 11:18:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 386 states have (on average 1.3419689119170986) internal successors, (518), 389 states have internal predecessors, (518), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:18:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 618 transitions. [2024-10-24 11:18:47,251 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 618 transitions. Word has length 140 [2024-10-24 11:18:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:47,251 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 618 transitions. [2024-10-24 11:18:47,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 618 transitions. [2024-10-24 11:18:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 11:18:47,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:47,253 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:47,259 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 (13)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:47,453 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-10-24 11:18:47,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:47,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1089595767, now seen corresponding path program 1 times [2024-10-24 11:18:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280558945] [2024-10-24 11:18:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:47,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:47,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:47,456 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-10-24 11:18:47,457 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-10-24 11:18:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:47,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:18:47,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:47,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:18:47,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-10-24 11:18:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:47,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:47,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:47,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280558945] [2024-10-24 11:18:47,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280558945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:47,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:47,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:47,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245236303] [2024-10-24 11:18:47,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:47,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:47,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:47,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:47,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:47,872 INFO L87 Difference]: Start difference. First operand 448 states and 618 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:48,026 INFO L93 Difference]: Finished difference Result 458 states and 631 transitions. [2024-10-24 11:18:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:48,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-24 11:18:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:48,029 INFO L225 Difference]: With dead ends: 458 [2024-10-24 11:18:48,030 INFO L226 Difference]: Without dead ends: 456 [2024-10-24 11:18:48,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:18:48,031 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 155 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:48,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 608 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-24 11:18:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2024-10-24 11:18:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 394 states have (on average 1.3350253807106598) internal successors, (526), 397 states have internal predecessors, (526), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:18:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 626 transitions. [2024-10-24 11:18:48,055 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 626 transitions. Word has length 142 [2024-10-24 11:18:48,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:48,056 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 626 transitions. [2024-10-24 11:18:48,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 626 transitions. [2024-10-24 11:18:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 11:18:48,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:48,058 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:48,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:48,259 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-10-24 11:18:48,259 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:48,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1089655349, now seen corresponding path program 1 times [2024-10-24 11:18:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:48,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535864231] [2024-10-24 11:18:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:48,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-10-24 11:18:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:48,261 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-10-24 11:18:48,263 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-10-24 11:18:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:48,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 11:18:48,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:48,530 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 14 treesize of output 10 [2024-10-24 11:18:48,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-24 11:18:48,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:48,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 37 [2024-10-24 11:18:48,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2024-10-24 11:18:49,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:49,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 73 [2024-10-24 11:18:50,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:50,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 101 [2024-10-24 11:18:50,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:50,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 105 treesize of output 116 [2024-10-24 11:18:51,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:51,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 92 [2024-10-24 11:18:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 455 proven. 33 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 11:18:51,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:18:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:51,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:51,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535864231] [2024-10-24 11:18:51,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535864231] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:18:51,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:18:51,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [26] total 28 [2024-10-24 11:18:51,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585720264] [2024-10-24 11:18:51,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:51,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:51,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:51,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:18:51,546 INFO L87 Difference]: Start difference. First operand 456 states and 626 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:51,958 INFO L93 Difference]: Finished difference Result 1131 states and 1546 transitions. [2024-10-24 11:18:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:51,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-24 11:18:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:51,962 INFO L225 Difference]: With dead ends: 1131 [2024-10-24 11:18:51,962 INFO L226 Difference]: Without dead ends: 804 [2024-10-24 11:18:51,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2024-10-24 11:18:51,964 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:51,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 602 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:18:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-24 11:18:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 801. [2024-10-24 11:18:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 709 states have (on average 1.3328631875881523) internal successors, (945), 716 states have internal predecessors, (945), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:18:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1089 transitions. [2024-10-24 11:18:52,003 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1089 transitions. Word has length 142 [2024-10-24 11:18:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:52,003 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1089 transitions. [2024-10-24 11:18:52,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1089 transitions. [2024-10-24 11:18:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 11:18:52,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:52,005 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:52,014 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-10-24 11:18:52,205 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-10-24 11:18:52,206 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:52,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:52,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1169707315, now seen corresponding path program 1 times [2024-10-24 11:18:52,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:52,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635931657] [2024-10-24 11:18:52,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:52,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:52,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:52,209 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-10-24 11:18:52,211 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-10-24 11:18:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:52,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:18:52,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-24 11:18:52,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:18:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:52,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635931657] [2024-10-24 11:18:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635931657] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:18:52,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:18:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-24 11:18:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596653911] [2024-10-24 11:18:52,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:52,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:52,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:18:52,644 INFO L87 Difference]: Start difference. First operand 801 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:52,776 INFO L93 Difference]: Finished difference Result 1569 states and 2119 transitions. [2024-10-24 11:18:52,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:52,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-24 11:18:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:52,780 INFO L225 Difference]: With dead ends: 1569 [2024-10-24 11:18:52,780 INFO L226 Difference]: Without dead ends: 926 [2024-10-24 11:18:52,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:18:52,784 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 65 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:52,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 516 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-10-24 11:18:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 817. [2024-10-24 11:18:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 725 states have (on average 1.322758620689655) internal successors, (959), 732 states have internal predecessors, (959), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:18:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1103 transitions. [2024-10-24 11:18:52,826 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1103 transitions. Word has length 142 [2024-10-24 11:18:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:52,827 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1103 transitions. [2024-10-24 11:18:52,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1103 transitions. [2024-10-24 11:18:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 11:18:52,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:52,829 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:52,836 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-10-24 11:18:53,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:53,030 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:53,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash 352058865, now seen corresponding path program 1 times [2024-10-24 11:18:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:53,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48941685] [2024-10-24 11:18:53,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:53,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:53,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:53,032 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-10-24 11:18:53,033 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-10-24 11:18:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:53,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:18:53,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-24 11:18:53,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:18:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:53,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:53,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48941685] [2024-10-24 11:18:53,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48941685] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:18:53,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:18:53,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-24 11:18:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881469177] [2024-10-24 11:18:53,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:53,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:53,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:53,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:53,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:18:53,576 INFO L87 Difference]: Start difference. First operand 817 states and 1103 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:53,721 INFO L93 Difference]: Finished difference Result 1537 states and 2065 transitions. [2024-10-24 11:18:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:53,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-24 11:18:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:53,726 INFO L225 Difference]: With dead ends: 1537 [2024-10-24 11:18:53,726 INFO L226 Difference]: Without dead ends: 914 [2024-10-24 11:18:53,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:18:53,728 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 48 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:53,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 521 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-10-24 11:18:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 803. [2024-10-24 11:18:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 711 states have (on average 1.3178621659634318) internal successors, (937), 718 states have internal predecessors, (937), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:18:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1081 transitions. [2024-10-24 11:18:53,766 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1081 transitions. Word has length 142 [2024-10-24 11:18:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:53,768 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1081 transitions. [2024-10-24 11:18:53,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1081 transitions. [2024-10-24 11:18:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 11:18:53,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:53,770 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:53,778 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 (17)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:53,970 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-10-24 11:18:53,971 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:53,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1381921610, now seen corresponding path program 1 times [2024-10-24 11:18:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:53,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942660864] [2024-10-24 11:18:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:53,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:53,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:53,973 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-10-24 11:18:53,974 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-10-24 11:18:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:54,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:18:54,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:54,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:54,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:54,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942660864] [2024-10-24 11:18:54,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942660864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:54,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:54,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:54,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548003161] [2024-10-24 11:18:54,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:54,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:54,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:54,202 INFO L87 Difference]: Start difference. First operand 803 states and 1081 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:54,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:54,341 INFO L93 Difference]: Finished difference Result 1546 states and 2072 transitions. [2024-10-24 11:18:54,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:54,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-10-24 11:18:54,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:54,345 INFO L225 Difference]: With dead ends: 1546 [2024-10-24 11:18:54,345 INFO L226 Difference]: Without dead ends: 937 [2024-10-24 11:18:54,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:54,347 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 66 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:54,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 779 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-10-24 11:18:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 825. [2024-10-24 11:18:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 733 states have (on average 1.311050477489768) internal successors, (961), 740 states have internal predecessors, (961), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:18:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1105 transitions. [2024-10-24 11:18:54,385 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1105 transitions. Word has length 143 [2024-10-24 11:18:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:54,386 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1105 transitions. [2024-10-24 11:18:54,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1105 transitions. [2024-10-24 11:18:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 11:18:54,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:54,388 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:54,394 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-10-24 11:18:54,588 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-10-24 11:18:54,589 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:54,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash -680857032, now seen corresponding path program 1 times [2024-10-24 11:18:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:54,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920037588] [2024-10-24 11:18:54,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:54,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:54,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:54,592 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-10-24 11:18:54,592 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-10-24 11:18:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:54,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:18:54,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:18:54,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:54,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:54,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920037588] [2024-10-24 11:18:54,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920037588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:54,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:54,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143540260] [2024-10-24 11:18:54,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:54,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:54,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:54,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:54,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:54,782 INFO L87 Difference]: Start difference. First operand 825 states and 1105 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:54,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:54,861 INFO L93 Difference]: Finished difference Result 1472 states and 1975 transitions. [2024-10-24 11:18:54,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:54,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-10-24 11:18:54,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:54,866 INFO L225 Difference]: With dead ends: 1472 [2024-10-24 11:18:54,866 INFO L226 Difference]: Without dead ends: 849 [2024-10-24 11:18:54,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 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-10-24 11:18:54,868 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:54,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-24 11:18:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 843. [2024-10-24 11:18:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 751 states have (on average 1.303595206391478) internal successors, (979), 758 states have internal predecessors, (979), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:18:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1123 transitions. [2024-10-24 11:18:54,912 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1123 transitions. Word has length 143 [2024-10-24 11:18:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:54,913 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1123 transitions. [2024-10-24 11:18:54,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:18:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1123 transitions. [2024-10-24 11:18:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:18:54,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:54,915 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:54,923 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-10-24 11:18:55,115 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-10-24 11:18:55,116 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:55,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash 946970331, now seen corresponding path program 1 times [2024-10-24 11:18:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:55,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4117814] [2024-10-24 11:18:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:55,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:55,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:55,118 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-10-24 11:18:55,119 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-10-24 11:18:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:55,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-24 11:18:55,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:55,369 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 8 treesize of output 1 [2024-10-24 11:18:55,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-24 11:18:55,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:55,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 26 [2024-10-24 11:18:55,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:55,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 26 [2024-10-24 11:18:55,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2024-10-24 11:18:55,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2024-10-24 11:18:56,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:56,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 100 [2024-10-24 11:18:57,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:57,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 111 [2024-10-24 11:18:57,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:57,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 168 treesize of output 74 [2024-10-24 11:19:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 465 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-24 11:19:00,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:19:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:19:01,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:19:01,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4117814] [2024-10-24 11:19:01,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4117814] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:19:01,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:19:01,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [31] total 37 [2024-10-24 11:19:01,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22934917] [2024-10-24 11:19:01,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:19:01,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:19:01,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:19:01,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:19:01,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 11:19:01,310 INFO L87 Difference]: Start difference. First operand 843 states and 1123 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:19:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:19:02,177 INFO L93 Difference]: Finished difference Result 1867 states and 2486 transitions. [2024-10-24 11:19:02,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:19:02,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-24 11:19:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:19:02,182 INFO L225 Difference]: With dead ends: 1867 [2024-10-24 11:19:02,182 INFO L226 Difference]: Without dead ends: 1226 [2024-10-24 11:19:02,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 11:19:02,185 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 65 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:19:02,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 724 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:19:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-10-24 11:19:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1066. [2024-10-24 11:19:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 974 states have (on average 1.320328542094456) internal successors, (1286), 981 states have internal predecessors, (1286), 72 states have call successors, (72), 19 states have call predecessors, (72), 19 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:19:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1430 transitions. [2024-10-24 11:19:02,235 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1430 transitions. Word has length 144 [2024-10-24 11:19:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:19:02,235 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1430 transitions. [2024-10-24 11:19:02,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:19:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1430 transitions. [2024-10-24 11:19:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:19:02,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:19:02,237 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:19:02,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-24 11:19:02,438 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-10-24 11:19:02,438 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:19:02,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:19:02,439 INFO L85 PathProgramCache]: Analyzing trace with hash 553943321, now seen corresponding path program 1 times [2024-10-24 11:19:02,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:19:02,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175671153] [2024-10-24 11:19:02,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:19:02,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:19:02,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:19:02,440 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-10-24 11:19:02,441 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-10-24 11:19:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:19:02,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 11:19:02,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:19:02,672 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 1 [2024-10-24 11:19:02,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-24 11:19:02,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:02,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 38 [2024-10-24 11:19:02,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:02,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-10-24 11:19:02,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:02,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-24 11:19:03,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:03,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 88 [2024-10-24 11:19:03,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:03,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 117 treesize of output 116 [2024-10-24 11:19:03,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:03,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 123 treesize of output 53 [2024-10-24 11:19:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 433 proven. 27 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-24 11:19:03,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:19:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:19:04,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:19:04,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175671153] [2024-10-24 11:19:04,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175671153] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:19:04,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:19:04,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-10-24 11:19:04,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156072015] [2024-10-24 11:19:04,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:19:04,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:19:04,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:19:04,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:19:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:19:04,081 INFO L87 Difference]: Start difference. First operand 1066 states and 1430 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:19:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:19:04,291 INFO L93 Difference]: Finished difference Result 2298 states and 3070 transitions. [2024-10-24 11:19:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:19:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-24 11:19:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:19:04,297 INFO L225 Difference]: With dead ends: 2298 [2024-10-24 11:19:04,297 INFO L226 Difference]: Without dead ends: 1505 [2024-10-24 11:19:04,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:19:04,299 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 118 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:19:04,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 289 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:19:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-24 11:19:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1378. [2024-10-24 11:19:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1268 states have (on average 1.3178233438485805) internal successors, (1671), 1277 states have internal predecessors, (1671), 84 states have call successors, (84), 25 states have call predecessors, (84), 25 states have return successors, (84), 75 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-24 11:19:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1839 transitions. [2024-10-24 11:19:04,359 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1839 transitions. Word has length 144 [2024-10-24 11:19:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:19:04,360 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1839 transitions. [2024-10-24 11:19:04,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:19:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1839 transitions. [2024-10-24 11:19:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:19:04,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:19:04,362 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:19:04,370 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 (21)] Forceful destruction successful, exit code 0 [2024-10-24 11:19:04,562 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-10-24 11:19:04,563 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:19:04,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:19:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1268734097, now seen corresponding path program 1 times [2024-10-24 11:19:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:19:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798191811] [2024-10-24 11:19:04,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:19:04,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:19:04,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:19:04,567 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-10-24 11:19:04,568 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-10-24 11:19:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:19:04,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-24 11:19:04,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:19:04,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:19:04,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-24 11:19:04,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:04,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 36 [2024-10-24 11:19:05,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:05,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2024-10-24 11:19:05,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2024-10-24 11:19:05,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2024-10-24 11:19:07,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:07,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 152 treesize of output 111 [2024-10-24 11:19:08,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:08,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 165 treesize of output 129 [2024-10-24 11:19:09,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:09,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 157 treesize of output 75 [2024-10-24 11:19:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 513 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-24 11:19:09,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:19:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:19:10,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:19:10,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798191811] [2024-10-24 11:19:10,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798191811] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:19:10,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:19:10,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [34] total 40 [2024-10-24 11:19:10,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295985832] [2024-10-24 11:19:10,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:19:10,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:19:10,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:19:10,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:19:10,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 11:19:10,647 INFO L87 Difference]: Start difference. First operand 1378 states and 1839 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:19:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:19:11,339 INFO L93 Difference]: Finished difference Result 2535 states and 3375 transitions. [2024-10-24 11:19:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:19:11,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-24 11:19:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:19:11,345 INFO L225 Difference]: With dead ends: 2535 [2024-10-24 11:19:11,346 INFO L226 Difference]: Without dead ends: 1505 [2024-10-24 11:19:11,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=323, Invalid=1483, Unknown=0, NotChecked=0, Total=1806 [2024-10-24 11:19:11,348 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 156 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:19:11,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 717 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:19:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-24 11:19:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1361. [2024-10-24 11:19:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1250 states have (on average 1.3152) internal successors, (1644), 1259 states have internal predecessors, (1644), 84 states have call successors, (84), 26 states have call predecessors, (84), 26 states have return successors, (84), 75 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-24 11:19:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1812 transitions. [2024-10-24 11:19:11,423 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1812 transitions. Word has length 144 [2024-10-24 11:19:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:19:11,424 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1812 transitions. [2024-10-24 11:19:11,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:19:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1812 transitions. [2024-10-24 11:19:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:19:11,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:19:11,425 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:19:11,433 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-10-24 11:19:11,626 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-10-24 11:19:11,627 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:19:11,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:19:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash 969602585, now seen corresponding path program 1 times [2024-10-24 11:19:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:19:11,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808475082] [2024-10-24 11:19:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:19:11,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:19:11,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:19:11,631 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-10-24 11:19:11,632 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-10-24 11:19:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:19:11,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 11:19:11,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:19:11,860 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 1 [2024-10-24 11:19:11,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-24 11:19:11,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:11,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-10-24 11:19:12,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:12,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 38 [2024-10-24 11:19:12,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:12,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-24 11:19:12,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:12,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 75 [2024-10-24 11:19:12,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:12,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 103 [2024-10-24 11:19:12,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:12,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 108 treesize of output 50 [2024-10-24 11:19:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 433 proven. 27 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-24 11:19:12,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:19:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:19:13,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:19:13,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808475082] [2024-10-24 11:19:13,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808475082] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:19:13,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:19:13,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-10-24 11:19:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194388100] [2024-10-24 11:19:13,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:19:13,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:19:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:19:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:19:13,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:19:13,083 INFO L87 Difference]: Start difference. First operand 1361 states and 1812 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:19:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:19:13,297 INFO L93 Difference]: Finished difference Result 2445 states and 3255 transitions. [2024-10-24 11:19:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:19:13,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-24 11:19:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:19:13,303 INFO L225 Difference]: With dead ends: 2445 [2024-10-24 11:19:13,303 INFO L226 Difference]: Without dead ends: 1436 [2024-10-24 11:19:13,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:19:13,305 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 67 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:19:13,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 525 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:19:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2024-10-24 11:19:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1251. [2024-10-24 11:19:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1169 states have (on average 1.3233532934131738) internal successors, (1547), 1174 states have internal predecessors, (1547), 62 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 11:19:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1671 transitions. [2024-10-24 11:19:13,376 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1671 transitions. Word has length 144 [2024-10-24 11:19:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:19:13,377 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1671 transitions. [2024-10-24 11:19:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:19:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1671 transitions. [2024-10-24 11:19:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:19:13,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:19:13,378 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:19:13,386 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-10-24 11:19:13,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-24 11:19:13,579 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:19:13,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:19:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash 576575575, now seen corresponding path program 1 times [2024-10-24 11:19:13,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:19:13,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135142544] [2024-10-24 11:19:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:19:13,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:19:13,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:19:13,581 INFO L229 MonitoredProcess]: Starting monitored process 24 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-10-24 11:19:13,582 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 (24)] Waiting until timeout for monitored process [2024-10-24 11:19:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:19:13,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-24 11:19:13,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:19:13,940 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-10-24 11:19:14,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-10-24 11:19:14,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:14,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 31 [2024-10-24 11:19:14,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:14,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 43 treesize of output 41 [2024-10-24 11:19:14,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2024-10-24 11:19:14,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 63 [2024-10-24 11:19:16,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:16,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 118 [2024-10-24 11:19:16,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:16,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 163 treesize of output 129 [2024-10-24 11:19:17,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:17,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 183 treesize of output 85 [2024-10-24 11:19:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 500 proven. 33 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-24 11:19:25,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:19:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 11:19:28,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:19:28,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135142544] [2024-10-24 11:19:28,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135142544] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:19:28,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:19:28,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [35] total 41 [2024-10-24 11:19:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549048389] [2024-10-24 11:19:28,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:19:28,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:19:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:19:28,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:19:28,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1356, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 11:19:28,207 INFO L87 Difference]: Start difference. First operand 1251 states and 1671 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:19:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:19:30,035 INFO L93 Difference]: Finished difference Result 2253 states and 3005 transitions. [2024-10-24 11:19:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:19:30,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-24 11:19:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:19:30,041 INFO L225 Difference]: With dead ends: 2253 [2024-10-24 11:19:30,041 INFO L226 Difference]: Without dead ends: 1354 [2024-10-24 11:19:30,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=312, Invalid=1580, Unknown=0, NotChecked=0, Total=1892 [2024-10-24 11:19:30,043 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 99 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:19:30,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 681 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:19:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-10-24 11:19:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1224. [2024-10-24 11:19:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1142 states have (on average 1.3231173380035026) internal successors, (1511), 1147 states have internal predecessors, (1511), 62 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 11:19:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1635 transitions. [2024-10-24 11:19:30,100 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1635 transitions. Word has length 144 [2024-10-24 11:19:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:19:30,100 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1635 transitions. [2024-10-24 11:19:30,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 11:19:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1635 transitions. [2024-10-24 11:19:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:19:30,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:19:30,102 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:19:30,111 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 (24)] Ended with exit code 0 [2024-10-24 11:19:30,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-10-24 11:19:30,303 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:19:30,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:19:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash 482019725, now seen corresponding path program 1 times [2024-10-24 11:19:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:19:30,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204299231] [2024-10-24 11:19:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:19:30,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:19:30,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:19:30,305 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-10-24 11:19:30,306 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-10-24 11:19:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:19:30,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-24 11:19:30,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:19:30,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:19:30,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-24 11:19:30,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:30,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 31 [2024-10-24 11:19:30,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:30,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 31 [2024-10-24 11:19:31,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-10-24 11:19:31,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2024-10-24 11:19:33,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 94 [2024-10-24 11:19:34,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:19:34,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 112