./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.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 e6cf723dedb21ead1464ef57728681bb47076b157f75d61c820bb94e52d9bb55 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:34:14,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:34:14,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:34:14,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:34:14,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:34:14,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:34:14,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:34:14,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:34:14,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:34:14,828 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:34:14,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:34:14,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:34:14,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:34:14,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:34:14,831 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:34:14,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:34:14,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:34:14,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:34:14,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:34:14,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:34:14,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:34:14,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:34:14,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:34:14,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:34:14,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:34:14,836 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:34:14,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:34:14,837 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:34:14,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:34:14,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:34:14,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:34:14,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:34:14,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:34:14,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:34:14,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:34:14,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:34:14,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:34:14,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:34:14,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:34:14,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:34:14,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:34:14,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:34:14,843 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 -> e6cf723dedb21ead1464ef57728681bb47076b157f75d61c820bb94e52d9bb55 [2024-11-22 12:34:15,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:34:15,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:34:15,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:34:15,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:34:15,156 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:34:15,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i [2024-11-22 12:34:16,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:34:16,924 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:34:16,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i [2024-11-22 12:34:16,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8994aa370/e5fa0968afd0439cbdef54e8d5a13a7f/FLAGda116cfa5 [2024-11-22 12:34:16,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8994aa370/e5fa0968afd0439cbdef54e8d5a13a7f [2024-11-22 12:34:16,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:34:16,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:34:16,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:34:16,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:34:16,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:34:16,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:16" (1/1) ... [2024-11-22 12:34:16,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@539ffe41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:16, skipping insertion in model container [2024-11-22 12:34:16,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:16" (1/1) ... [2024-11-22 12:34:16,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:34:17,190 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i[916,929] [2024-11-22 12:34:17,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:34:17,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:34:17,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i[916,929] [2024-11-22 12:34:17,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:34:17,356 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:34:17,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17 WrapperNode [2024-11-22 12:34:17,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:34:17,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:34:17,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:34:17,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:34:17,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,430 INFO L138 Inliner]: procedures = 29, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2024-11-22 12:34:17,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:34:17,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:34:17,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:34:17,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:34:17,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,526 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 14, 28, 57, 14]. 50 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 3, 1]. The 12 writes are split as follows [0, 2, 4, 4, 2]. [2024-11-22 12:34:17,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:34:17,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:34:17,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:34:17,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:34:17,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (1/1) ... [2024-11-22 12:34:17,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:34:17,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:34:17,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:34:17,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:34:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:34:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:34:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:34:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:34:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:34:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:34:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:34:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:34:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:34:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:34:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:34:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:34:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:34:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:34:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:34:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:34:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:34:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:34:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:34:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:34:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:34:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:34:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:34:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:34:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:34:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:34:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:34:17,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:34:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:34:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:34:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:34:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:34:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:34:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:34:17,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:34:17,838 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:34:17,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:34:18,339 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-22 12:34:18,339 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:34:18,355 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:34:18,356 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:34:18,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:18 BoogieIcfgContainer [2024-11-22 12:34:18,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:34:18,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:34:18,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:34:18,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:34:18,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:34:16" (1/3) ... [2024-11-22 12:34:18,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b4aeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:18, skipping insertion in model container [2024-11-22 12:34:18,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:17" (2/3) ... [2024-11-22 12:34:18,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b4aeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:18, skipping insertion in model container [2024-11-22 12:34:18,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:18" (3/3) ... [2024-11-22 12:34:18,368 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-47.i [2024-11-22 12:34:18,385 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:34:18,386 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:34:18,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:34:18,468 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;@38cc104a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:34:18,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:34:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:34:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:18,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:18,483 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:18,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:18,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash 683533110, now seen corresponding path program 1 times [2024-11-22 12:34:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669373618] [2024-11-22 12:34:18,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:18,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-22 12:34:18,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:34:18,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669373618] [2024-11-22 12:34:18,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669373618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:18,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452414107] [2024-11-22 12:34:18,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:18,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:34:18,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:34:18,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:34:18,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 12:34:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:19,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:34:19,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-22 12:34:19,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:19,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452414107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:19,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:34:19,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:34:19,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077246244] [2024-11-22 12:34:19,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:19,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:34:19,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:34:19,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:34:19,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:34:19,130 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:34:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:19,157 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-22 12:34:19,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:34:19,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-22 12:34:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:19,169 INFO L225 Difference]: With dead ends: 185 [2024-11-22 12:34:19,169 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 12:34:19,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:34:19,176 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:19,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 12:34:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-22 12:34:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:34:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-22 12:34:19,238 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-22 12:34:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:19,240 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-22 12:34:19,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:34:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-22 12:34:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:19,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:19,246 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:19,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:19,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 12:34:19,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:19,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash -310292876, now seen corresponding path program 1 times [2024-11-22 12:34:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:19,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579601537] [2024-11-22 12:34:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:19,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:34:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579601537] [2024-11-22 12:34:19,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579601537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:34:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166495483] [2024-11-22 12:34:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:19,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:34:19,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:34:19,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:34:19,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:34:19,705 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:19,740 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-22 12:34:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:34:19,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:34:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:19,744 INFO L225 Difference]: With dead ends: 182 [2024-11-22 12:34:19,744 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 12:34:19,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:34:19,747 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:19,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 12:34:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 12:34:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:34:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-22 12:34:19,765 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-22 12:34:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:19,766 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-22 12:34:19,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-22 12:34:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:19,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:19,769 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:19,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:34:19,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:19,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1999236618, now seen corresponding path program 1 times [2024-11-22 12:34:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264959901] [2024-11-22 12:34:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 12:34:20,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:34:20,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264959901] [2024-11-22 12:34:20,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264959901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:20,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072192605] [2024-11-22 12:34:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:20,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:34:20,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:34:20,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:34:20,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 12:34:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:20,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:34:20,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:20,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:20,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072192605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:20,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:34:20,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-22 12:34:20,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234616123] [2024-11-22 12:34:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:20,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:34:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:34:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:34:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:34:20,358 INFO L87 Difference]: Start difference. First operand 93 states and 135 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:20,405 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-22 12:34:20,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:34:20,406 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:34:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:20,411 INFO L225 Difference]: With dead ends: 186 [2024-11-22 12:34:20,411 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 12:34:20,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:34:20,413 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:20,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:20,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 12:34:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-22 12:34:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:34:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-22 12:34:20,424 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 84 [2024-11-22 12:34:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:20,424 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-22 12:34:20,425 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-22 12:34:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:20,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:20,427 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:20,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 12:34:20,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 12:34:20,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:20,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:20,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1997389576, now seen corresponding path program 1 times [2024-11-22 12:34:20,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:20,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016049918] [2024-11-22 12:34:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 12:34:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:34:20,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016049918] [2024-11-22 12:34:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016049918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028860601] [2024-11-22 12:34:20,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:20,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:34:20,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:34:20,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:34:20,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 12:34:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:21,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:34:21,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:21,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-22 12:34:21,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 12:34:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:21,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028860601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:21,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:34:21,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-22 12:34:21,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553777528] [2024-11-22 12:34:21,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:21,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:34:21,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:34:21,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:34:21,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:34:21,264 INFO L87 Difference]: Start difference. First operand 95 states and 137 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:21,591 INFO L93 Difference]: Finished difference Result 279 states and 405 transitions. [2024-11-22 12:34:21,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:34:21,592 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:34:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:21,593 INFO L225 Difference]: With dead ends: 279 [2024-11-22 12:34:21,594 INFO L226 Difference]: Without dead ends: 187 [2024-11-22 12:34:21,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:34:21,595 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 122 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:21,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 544 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:34:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-22 12:34:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2024-11-22 12:34:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 153 states have (on average 1.411764705882353) internal successors, (216), 153 states have internal predecessors, (216), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 12:34:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 252 transitions. [2024-11-22 12:34:21,621 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 252 transitions. Word has length 84 [2024-11-22 12:34:21,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:21,621 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 252 transitions. [2024-11-22 12:34:21,621 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 252 transitions. [2024-11-22 12:34:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:21,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:21,628 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:21,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:21,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:34:21,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:21,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash -485984406, now seen corresponding path program 1 times [2024-11-22 12:34:21,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:34:21,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391836198] [2024-11-22 12:34:21,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:21,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:34:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:34:21,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:34:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:34:22,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:34:22,059 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:34:22,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:34:22,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:34:22,068 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-22 12:34:22,155 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:34:22,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:34:22 BoogieIcfgContainer [2024-11-22 12:34:22,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:34:22,159 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:34:22,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:34:22,159 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:34:22,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:18" (3/4) ... [2024-11-22 12:34:22,166 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:34:22,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:34:22,168 INFO L158 Benchmark]: Toolchain (without parser) took 5214.04ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 102.9MB in the beginning and 181.9MB in the end (delta: -79.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:34:22,169 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 172.0MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:34:22,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.44ms. Allocated memory is still 172.0MB. Free memory was 102.6MB in the beginning and 87.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 12:34:22,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.68ms. Allocated memory is still 172.0MB. Free memory was 87.0MB in the beginning and 83.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 12:34:22,170 INFO L158 Benchmark]: Boogie Preprocessor took 127.82ms. Allocated memory is still 172.0MB. Free memory was 83.6MB in the beginning and 139.6MB in the end (delta: -56.0MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-11-22 12:34:22,170 INFO L158 Benchmark]: RCFGBuilder took 797.08ms. Allocated memory is still 172.0MB. Free memory was 139.0MB in the beginning and 107.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-22 12:34:22,171 INFO L158 Benchmark]: TraceAbstraction took 3799.80ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 106.7MB in the beginning and 183.0MB in the end (delta: -76.3MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2024-11-22 12:34:22,171 INFO L158 Benchmark]: Witness Printer took 8.93ms. Allocated memory is still 228.6MB. Free memory is still 181.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:34:22,175 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.27ms. Allocated memory is still 172.0MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.44ms. Allocated memory is still 172.0MB. Free memory was 102.6MB in the beginning and 87.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.68ms. Allocated memory is still 172.0MB. Free memory was 87.0MB in the beginning and 83.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.82ms. Allocated memory is still 172.0MB. Free memory was 83.6MB in the beginning and 139.6MB in the end (delta: -56.0MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * RCFGBuilder took 797.08ms. Allocated memory is still 172.0MB. Free memory was 139.0MB in the beginning and 107.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3799.80ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 106.7MB in the beginning and 183.0MB in the end (delta: -76.3MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Witness Printer took 8.93ms. Allocated memory is still 228.6MB. Free memory is still 181.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L25-L27] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L25-L27] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L25-L27] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 8 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 8 }; [L34] signed long int last_1_signed_long_int_Array_0_0_ = 8; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] EXPR signed_long_int_Array_0[0] [L81] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L91] RET updateLastVariables() [L92] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L71] double_Array_0[0] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L73] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(-4 > last_1_signed_long_int_Array_0_0_) [L43] EXPR signed_char_Array_0[1] [L43] signed_char_Array_0[0] = signed_char_Array_0[1] [L45] EXPR BOOL_unsigned_char_Array_0[0] [L45] unsigned char stepLocal_0 = ! BOOL_unsigned_char_Array_0[0]; [L46] stepLocal_0 || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L46] stepLocal_0 || BOOL_unsigned_char_Array_0[1] [L46] EXPR BOOL_unsigned_char_Array_0[1] [L46] stepLocal_0 || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L46] COND FALSE !(stepLocal_0 || BOOL_unsigned_char_Array_0[1]) [L53] EXPR double_Array_0[0] [L53] double_Array_0[1] = double_Array_0[0] [L54] EXPR double_Array_0[1] [L54] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L54] COND FALSE !(double_Array_0[1] <= double_Array_0[1]) [L59] EXPR signed_long_int_Array_0[0] [L59] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L59] COND TRUE signed_long_int_Array_0[0] > signed_char_Array_0[0] [L60] EXPR double_Array_0[0] [L60] double_Array_0[2] = double_Array_0[0] [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR (double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1) [L84] EXPR signed_long_int_Array_0[0] [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR (signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1 [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[0] [L84] EXPR (signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR (double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR ((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR ((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR (((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])))) && (((! BOOL_unsigned_char_Array_0[0]) || BOOL_unsigned_char_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) < 0 ) ? -((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) : ((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR (((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])))) && (((! BOOL_unsigned_char_Array_0[0]) || BOOL_unsigned_char_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) < 0 ) ? -((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) : ((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR ((((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])))) && (((! BOOL_unsigned_char_Array_0[0]) || BOOL_unsigned_char_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) < 0 ) ? -((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) : ((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) : 1)) && (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR ((((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])))) && (((! BOOL_unsigned_char_Array_0[0]) || BOOL_unsigned_char_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) < 0 ) ? -((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) : ((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) : 1)) && (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84-L85] return ((((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])))) && (((! BOOL_unsigned_char_Array_0[0]) || BOOL_unsigned_char_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) < 0 ) ? -((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) : ((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) : 1)) && (double_Array_0[1] == ((double) double_Array_0[0])) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 1322 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 757 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 565 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 6 NumberOfNonLiveVariables, 935 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 944/1008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 12:34:22,200 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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.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 e6cf723dedb21ead1464ef57728681bb47076b157f75d61c820bb94e52d9bb55 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:34:24,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:34:24,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:34:24,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:34:24,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:34:24,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:34:24,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:34:24,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:34:24,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:34:24,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:34:24,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:34:24,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:34:24,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:34:24,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:34:24,590 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:34:24,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:34:24,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:34:24,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:34:24,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:34:24,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:34:24,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:34:24,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:34:24,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:34:24,598 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:34:24,598 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:34:24,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:34:24,598 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:34:24,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:34:24,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:34:24,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:34:24,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:34:24,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:34:24,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:34:24,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:34:24,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:34:24,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:34:24,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:34:24,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:34:24,604 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:34:24,605 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:34:24,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:34:24,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:34:24,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:34:24,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:34:24,606 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 -> e6cf723dedb21ead1464ef57728681bb47076b157f75d61c820bb94e52d9bb55 [2024-11-22 12:34:24,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:34:24,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:34:24,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:34:24,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:34:24,989 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:34:24,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i [2024-11-22 12:34:26,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:34:26,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:34:26,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i [2024-11-22 12:34:26,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d20ab843/0254d4cdbb454b1dbd854a6ff2f9e873/FLAG61757ef6c [2024-11-22 12:34:26,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d20ab843/0254d4cdbb454b1dbd854a6ff2f9e873 [2024-11-22 12:34:26,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:34:26,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:34:26,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:34:26,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:34:26,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:34:26,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:26" (1/1) ... [2024-11-22 12:34:26,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8f2a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:26, skipping insertion in model container [2024-11-22 12:34:26,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:26" (1/1) ... [2024-11-22 12:34:26,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:34:27,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i[916,929] [2024-11-22 12:34:27,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:34:27,189 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:34:27,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i[916,929] [2024-11-22 12:34:27,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:34:27,276 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:34:27,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27 WrapperNode [2024-11-22 12:34:27,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:34:27,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:34:27,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:34:27,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:34:27,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,353 INFO L138 Inliner]: procedures = 33, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 455 [2024-11-22 12:34:27,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:34:27,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:34:27,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:34:27,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:34:27,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,415 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 14, 28, 57, 14]. 50 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 3, 1]. The 12 writes are split as follows [0, 2, 4, 4, 2]. [2024-11-22 12:34:27,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:34:27,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:34:27,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:34:27,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:34:27,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (1/1) ... [2024-11-22 12:34:27,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:34:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:34:27,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:34:27,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 12:34:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 12:34:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-22 12:34:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-22 12:34:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-22 12:34:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 12:34:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 12:34:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-22 12:34:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-22 12:34:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-22 12:34:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:34:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:34:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:34:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:34:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:34:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:34:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:34:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:34:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:34:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:34:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 12:34:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 12:34:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 12:34:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 12:34:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-22 12:34:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-22 12:34:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-22 12:34:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-22 12:34:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-22 12:34:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-22 12:34:27,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 12:34:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 12:34:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 12:34:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 12:34:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-22 12:34:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:34:27,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:34:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:34:27,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:34:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:34:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:34:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:34:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:34:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:34:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 12:34:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 12:34:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 12:34:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 12:34:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-22 12:34:27,718 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:34:27,720 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:34:28,335 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-11-22 12:34:28,335 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:34:28,355 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:34:28,355 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:34:28,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:28 BoogieIcfgContainer [2024-11-22 12:34:28,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:34:28,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:34:28,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:34:28,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:34:28,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:34:26" (1/3) ... [2024-11-22 12:34:28,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ceef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:28, skipping insertion in model container [2024-11-22 12:34:28,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:27" (2/3) ... [2024-11-22 12:34:28,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ceef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:28, skipping insertion in model container [2024-11-22 12:34:28,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:28" (3/3) ... [2024-11-22 12:34:28,365 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-47.i [2024-11-22 12:34:28,382 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:34:28,382 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:34:28,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:34:28,455 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;@18dbc94c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:34:28,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:34:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:34:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:28,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:28,474 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:28,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:28,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:28,481 INFO L85 PathProgramCache]: Analyzing trace with hash 683533110, now seen corresponding path program 1 times [2024-11-22 12:34:28,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:28,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219060108] [2024-11-22 12:34:28,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:28,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:28,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:28,502 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:28,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 12:34:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:28,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:34:28,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:34:28,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:28,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:28,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219060108] [2024-11-22 12:34:28,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219060108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:28,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:28,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:34:28,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491284419] [2024-11-22 12:34:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:28,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:34:28,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:34:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:34:28,879 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:34:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:28,916 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-22 12:34:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:34:28,918 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-22 12:34:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:28,926 INFO L225 Difference]: With dead ends: 185 [2024-11-22 12:34:28,927 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 12:34:28,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:34:28,936 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:28,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 12:34:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-22 12:34:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:34:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-22 12:34:28,989 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2024-11-22 12:34:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:28,990 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-22 12:34:28,990 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:34:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-22 12:34:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:28,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:28,997 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:29,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 12:34:29,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:29,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:29,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:29,199 INFO L85 PathProgramCache]: Analyzing trace with hash -310292876, now seen corresponding path program 1 times [2024-11-22 12:34:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:29,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402879372] [2024-11-22 12:34:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:29,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:29,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:29,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:29,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 12:34:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:29,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 12:34:29,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:29,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:29,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402879372] [2024-11-22 12:34:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402879372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:29,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:29,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:34:29,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537100313] [2024-11-22 12:34:29,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:29,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:34:29,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:29,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:34:29,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:34:29,501 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:29,541 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-11-22 12:34:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:34:29,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:34:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:29,543 INFO L225 Difference]: With dead ends: 182 [2024-11-22 12:34:29,543 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 12:34:29,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:34:29,548 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:29,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 12:34:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 12:34:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:34:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-22 12:34:29,568 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2024-11-22 12:34:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:29,572 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-22 12:34:29,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-22 12:34:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:29,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:29,575 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:29,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:29,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:29,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:29,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1999236618, now seen corresponding path program 1 times [2024-11-22 12:34:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:29,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492717827] [2024-11-22 12:34:29,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:29,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:29,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:29,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:29,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 12:34:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:30,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:34:30,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:30,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:30,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:30,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492717827] [2024-11-22 12:34:30,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492717827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:30,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:30,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:34:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548589192] [2024-11-22 12:34:30,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:30,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:34:30,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:34:30,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:30,088 INFO L87 Difference]: Start difference. First operand 93 states and 135 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:30,164 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-22 12:34:30,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:34:30,166 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:34:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:30,168 INFO L225 Difference]: With dead ends: 186 [2024-11-22 12:34:30,168 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 12:34:30,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:30,170 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:30,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 12:34:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-22 12:34:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:34:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-22 12:34:30,182 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2024-11-22 12:34:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:30,183 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-22 12:34:30,183 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-22 12:34:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:30,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:30,185 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:30,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 12:34:30,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:30,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:30,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash -487831448, now seen corresponding path program 1 times [2024-11-22 12:34:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835281033] [2024-11-22 12:34:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:30,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:30,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:30,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:30,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 12:34:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:30,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:34:30,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:30,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:30,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:30,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835281033] [2024-11-22 12:34:30,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835281033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:30,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:34:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365374559] [2024-11-22 12:34:30,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:30,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:34:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:30,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:34:30,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:30,722 INFO L87 Difference]: Start difference. First operand 96 states and 138 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:30,776 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-22 12:34:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:34:30,780 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:34:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:30,781 INFO L225 Difference]: With dead ends: 194 [2024-11-22 12:34:30,781 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 12:34:30,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:30,783 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:30,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 12:34:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-22 12:34:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 12:34:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-22 12:34:30,795 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 84 [2024-11-22 12:34:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:30,796 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-22 12:34:30,799 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-22 12:34:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:30,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:30,801 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:30,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 12:34:31,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:31,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:31,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -485984406, now seen corresponding path program 1 times [2024-11-22 12:34:31,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:31,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158179317] [2024-11-22 12:34:31,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:31,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:31,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:31,010 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:31,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 12:34:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:31,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 12:34:31,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:32,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:32,055 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 152 treesize of output 62 [2024-11-22 12:34:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:34:32,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:32,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:32,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158179317] [2024-11-22 12:34:32,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158179317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:32,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [745313822] [2024-11-22 12:34:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:32,431 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:34:32,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:34:32,434 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:34:32,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-22 12:34:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:33,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 12:34:33,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:34,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:34,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 62 [2024-11-22 12:34:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:34:35,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [745313822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:35,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:34:35,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-22 12:34:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234264731] [2024-11-22 12:34:35,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:34:35,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 12:34:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:35,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 12:34:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-22 12:34:35,313 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-22 12:34:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:36,394 INFO L93 Difference]: Finished difference Result 290 states and 413 transitions. [2024-11-22 12:34:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:34:36,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 84 [2024-11-22 12:34:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:36,397 INFO L225 Difference]: With dead ends: 290 [2024-11-22 12:34:36,398 INFO L226 Difference]: Without dead ends: 193 [2024-11-22 12:34:36,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-11-22 12:34:36,399 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 500 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:36,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 845 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 12:34:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-22 12:34:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2024-11-22 12:34:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.3905325443786982) internal successors, (235), 170 states have internal predecessors, (235), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 12:34:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 271 transitions. [2024-11-22 12:34:36,424 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 271 transitions. Word has length 84 [2024-11-22 12:34:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:36,425 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 271 transitions. [2024-11-22 12:34:36,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-22 12:34:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 271 transitions. [2024-11-22 12:34:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:36,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:36,427 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:36,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:36,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:36,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:36,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:36,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1873282605, now seen corresponding path program 1 times [2024-11-22 12:34:36,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:36,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629182391] [2024-11-22 12:34:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:36,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:36,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:36,833 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:36,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 12:34:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:37,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 12:34:37,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:37,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-22 12:34:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:37,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:37,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:37,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629182391] [2024-11-22 12:34:37,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629182391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:37,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:37,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:34:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382523121] [2024-11-22 12:34:37,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:37,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:34:37,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:37,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:34:37,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:34:37,319 INFO L87 Difference]: Start difference. First operand 190 states and 271 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:37,903 INFO L93 Difference]: Finished difference Result 747 states and 1069 transitions. [2024-11-22 12:34:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:34:37,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:34:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:37,909 INFO L225 Difference]: With dead ends: 747 [2024-11-22 12:34:37,909 INFO L226 Difference]: Without dead ends: 560 [2024-11-22 12:34:37,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:34:37,910 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 270 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:37,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 494 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:34:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-22 12:34:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 516. [2024-11-22 12:34:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 455 states have (on average 1.3736263736263736) internal successors, (625), 458 states have internal predecessors, (625), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 12:34:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 733 transitions. [2024-11-22 12:34:37,952 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 733 transitions. Word has length 84 [2024-11-22 12:34:37,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:37,953 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 733 transitions. [2024-11-22 12:34:37,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 733 transitions. [2024-11-22 12:34:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:37,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:37,955 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:37,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 12:34:38,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:38,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:38,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:38,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1615117167, now seen corresponding path program 1 times [2024-11-22 12:34:38,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:38,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124139921] [2024-11-22 12:34:38,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:38,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:38,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:38,161 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:38,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 12:34:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:38,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:34:38,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:38,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:38,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:38,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124139921] [2024-11-22 12:34:38,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124139921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:38,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:38,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:34:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20659922] [2024-11-22 12:34:38,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:38,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:34:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:38,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:34:38,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:38,362 INFO L87 Difference]: Start difference. First operand 516 states and 733 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:38,419 INFO L93 Difference]: Finished difference Result 1045 states and 1485 transitions. [2024-11-22 12:34:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:34:38,420 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-11-22 12:34:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:38,424 INFO L225 Difference]: With dead ends: 1045 [2024-11-22 12:34:38,424 INFO L226 Difference]: Without dead ends: 532 [2024-11-22 12:34:38,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:38,426 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:38,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-22 12:34:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 520. [2024-11-22 12:34:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 459 states have (on average 1.3703703703703705) internal successors, (629), 462 states have internal predecessors, (629), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 12:34:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 737 transitions. [2024-11-22 12:34:38,458 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 737 transitions. Word has length 84 [2024-11-22 12:34:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:38,458 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 737 transitions. [2024-11-22 12:34:38,459 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 737 transitions. [2024-11-22 12:34:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 12:34:38,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:38,461 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:38,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 12:34:38,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:38,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:38,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash 900801004, now seen corresponding path program 1 times [2024-11-22 12:34:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:38,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334868783] [2024-11-22 12:34:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:38,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:38,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:38,664 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:38,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 12:34:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:38,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:34:38,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:34:38,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:38,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334868783] [2024-11-22 12:34:38,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334868783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:38,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:38,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:34:38,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255374271] [2024-11-22 12:34:38,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:38,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:34:38,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:38,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:34:38,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:38,840 INFO L87 Difference]: Start difference. First operand 520 states and 737 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:34:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:38,897 INFO L93 Difference]: Finished difference Result 1037 states and 1471 transitions. [2024-11-22 12:34:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:34:38,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-11-22 12:34:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:38,902 INFO L225 Difference]: With dead ends: 1037 [2024-11-22 12:34:38,902 INFO L226 Difference]: Without dead ends: 520 [2024-11-22 12:34:38,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:38,912 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:38,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:34:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-22 12:34:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-11-22 12:34:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 459 states have (on average 1.363834422657952) internal successors, (626), 462 states have internal predecessors, (626), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 12:34:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 734 transitions. [2024-11-22 12:34:38,944 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 734 transitions. Word has length 84 [2024-11-22 12:34:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:38,945 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 734 transitions. [2024-11-22 12:34:38,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:34:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 734 transitions. [2024-11-22 12:34:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-22 12:34:38,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:38,947 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:38,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:39,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:39,148 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:39,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1394365254, now seen corresponding path program 1 times [2024-11-22 12:34:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:39,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042337898] [2024-11-22 12:34:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:39,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:39,150 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:39,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 12:34:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:39,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:34:39,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:39,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-22 12:34:39,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-22 12:34:39,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-22 12:34:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:39,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:39,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042337898] [2024-11-22 12:34:39,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042337898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:39,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:39,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:34:39,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872195081] [2024-11-22 12:34:39,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:39,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:34:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:34:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:34:39,389 INFO L87 Difference]: Start difference. First operand 520 states and 734 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:39,788 INFO L93 Difference]: Finished difference Result 898 states and 1272 transitions. [2024-11-22 12:34:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:34:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2024-11-22 12:34:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:39,795 INFO L225 Difference]: With dead ends: 898 [2024-11-22 12:34:39,795 INFO L226 Difference]: Without dead ends: 709 [2024-11-22 12:34:39,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:34:39,797 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 123 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:39,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 535 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:34:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-22 12:34:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 685. [2024-11-22 12:34:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 604 states have (on average 1.3609271523178808) internal successors, (822), 608 states have internal predecessors, (822), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 12:34:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 966 transitions. [2024-11-22 12:34:39,843 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 966 transitions. Word has length 85 [2024-11-22 12:34:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:39,844 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 966 transitions. [2024-11-22 12:34:39,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 966 transitions. [2024-11-22 12:34:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:34:39,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:39,847 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:39,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-22 12:34:40,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:40,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:40,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:40,048 INFO L85 PathProgramCache]: Analyzing trace with hash -384549338, now seen corresponding path program 1 times [2024-11-22 12:34:40,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:40,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898028237] [2024-11-22 12:34:40,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:40,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:40,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:40,052 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:40,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 12:34:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:40,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 12:34:40,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:40,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-22 12:34:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:40,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:40,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:40,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898028237] [2024-11-22 12:34:40,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898028237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:40,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:40,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:34:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944419288] [2024-11-22 12:34:40,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:40,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:34:40,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:40,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:34:40,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:34:40,514 INFO L87 Difference]: Start difference. First operand 685 states and 966 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:41,126 INFO L93 Difference]: Finished difference Result 1397 states and 1975 transitions. [2024-11-22 12:34:41,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:34:41,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-22 12:34:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:41,131 INFO L225 Difference]: With dead ends: 1397 [2024-11-22 12:34:41,131 INFO L226 Difference]: Without dead ends: 715 [2024-11-22 12:34:41,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:34:41,133 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 202 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:41,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 494 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:34:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-22 12:34:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 671. [2024-11-22 12:34:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 590 states have (on average 1.3593220338983052) internal successors, (802), 594 states have internal predecessors, (802), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 12:34:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 946 transitions. [2024-11-22 12:34:41,162 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 946 transitions. Word has length 86 [2024-11-22 12:34:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:41,163 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 946 transitions. [2024-11-22 12:34:41,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 946 transitions. [2024-11-22 12:34:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:34:41,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:41,165 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:41,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:41,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:41,366 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:41,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1146496372, now seen corresponding path program 1 times [2024-11-22 12:34:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:41,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171655428] [2024-11-22 12:34:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:41,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:41,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:41,370 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:41,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 12:34:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:41,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 12:34:41,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:41,607 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-11-22 12:34:41,746 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 37 treesize of output 30 [2024-11-22 12:34:41,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:41,948 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 52 treesize of output 42 [2024-11-22 12:34:42,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:42,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 92 treesize of output 44 [2024-11-22 12:34:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 83 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 12:34:42,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:42,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:42,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171655428] [2024-11-22 12:34:42,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171655428] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:42,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:34:42,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2024-11-22 12:34:42,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52542020] [2024-11-22 12:34:42,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:42,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:34:42,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:42,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:34:42,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-22 12:34:42,453 INFO L87 Difference]: Start difference. First operand 671 states and 946 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:42,881 INFO L93 Difference]: Finished difference Result 1916 states and 2687 transitions. [2024-11-22 12:34:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:34:42,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-22 12:34:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:42,890 INFO L225 Difference]: With dead ends: 1916 [2024-11-22 12:34:42,890 INFO L226 Difference]: Without dead ends: 1248 [2024-11-22 12:34:42,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-22 12:34:42,893 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 103 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:42,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 486 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:34:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2024-11-22 12:34:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1238. [2024-11-22 12:34:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1109 states have (on average 1.3552750225428314) internal successors, (1503), 1125 states have internal predecessors, (1503), 112 states have call successors, (112), 16 states have call predecessors, (112), 16 states have return successors, (112), 96 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-22 12:34:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1727 transitions. [2024-11-22 12:34:42,963 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1727 transitions. Word has length 86 [2024-11-22 12:34:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:42,964 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1727 transitions. [2024-11-22 12:34:42,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1727 transitions. [2024-11-22 12:34:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:34:42,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:42,966 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:42,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-22 12:34:43,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:43,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:43,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1029109966, now seen corresponding path program 1 times [2024-11-22 12:34:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:43,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427837736] [2024-11-22 12:34:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:43,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:43,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:43,173 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:43,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 12:34:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:43,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 12:34:43,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:44,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:44,176 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 172 treesize of output 98 [2024-11-22 12:34:44,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:44,385 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 202 treesize of output 104 [2024-11-22 12:34:44,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:44,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 274 treesize of output 100 [2024-11-22 12:34:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:34:44,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:44,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427837736] [2024-11-22 12:34:44,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427837736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [591242964] [2024-11-22 12:34:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:44,779 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:34:44,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:34:44,782 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:34:44,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-22 12:34:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:46,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 12:34:46,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:46,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-22 12:34:47,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 88 [2024-11-22 12:34:47,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:47,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 108 [2024-11-22 12:34:52,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:34:52,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 209 treesize of output 113 [2024-11-22 12:34:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:34:57,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:34:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:34:57,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [591242964] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:34:57,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:34:57,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 10] total 21 [2024-11-22 12:34:57,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268404744] [2024-11-22 12:34:57,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:57,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:34:57,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:57,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:34:57,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=379, Unknown=3, NotChecked=0, Total=462 [2024-11-22 12:34:57,446 INFO L87 Difference]: Start difference. First operand 1238 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:57,983 INFO L93 Difference]: Finished difference Result 3119 states and 4351 transitions. [2024-11-22 12:34:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:34:57,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-11-22 12:34:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:57,992 INFO L225 Difference]: With dead ends: 3119 [2024-11-22 12:34:57,992 INFO L226 Difference]: Without dead ends: 1884 [2024-11-22 12:34:57,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=85, Invalid=418, Unknown=3, NotChecked=0, Total=506 [2024-11-22 12:34:57,995 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 222 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:57,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 342 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:34:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2024-11-22 12:34:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1756. [2024-11-22 12:34:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1539 states have (on average 1.3307342430149447) internal successors, (2048), 1569 states have internal predecessors, (2048), 186 states have call successors, (186), 30 states have call predecessors, (186), 30 states have return successors, (186), 156 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-22 12:34:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2420 transitions. [2024-11-22 12:34:58,077 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2420 transitions. Word has length 86 [2024-11-22 12:34:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:58,077 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2420 transitions. [2024-11-22 12:34:58,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:34:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2420 transitions. [2024-11-22 12:34:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:34:58,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:58,080 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:58,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:58,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:58,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:58,481 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:58,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:58,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1828508526, now seen corresponding path program 1 times [2024-11-22 12:34:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:58,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412321162] [2024-11-22 12:34:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:58,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:58,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:58,491 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:58,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 12:34:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:58,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 12:34:58,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:34:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-22 12:34:58,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:34:58,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:34:58,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412321162] [2024-11-22 12:34:58,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412321162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:34:58,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:34:58,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:34:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140220075] [2024-11-22 12:34:58,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:34:58,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:34:58,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:34:58,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:34:58,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:34:58,736 INFO L87 Difference]: Start difference. First operand 1756 states and 2420 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-22 12:34:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:34:58,902 INFO L93 Difference]: Finished difference Result 3585 states and 4928 transitions. [2024-11-22 12:34:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:34:58,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2024-11-22 12:34:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:34:58,914 INFO L225 Difference]: With dead ends: 3585 [2024-11-22 12:34:58,915 INFO L226 Difference]: Without dead ends: 1802 [2024-11-22 12:34:58,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:34:58,930 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:34:58,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 582 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:34:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-22 12:34:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1756. [2024-11-22 12:34:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1539 states have (on average 1.3209876543209877) internal successors, (2033), 1569 states have internal predecessors, (2033), 186 states have call successors, (186), 30 states have call predecessors, (186), 30 states have return successors, (186), 156 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-22 12:34:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2405 transitions. [2024-11-22 12:34:59,021 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2405 transitions. Word has length 86 [2024-11-22 12:34:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:34:59,021 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2405 transitions. [2024-11-22 12:34:59,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-22 12:34:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2405 transitions. [2024-11-22 12:34:59,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 12:34:59,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:34:59,024 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:34:59,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-22 12:34:59,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:59,225 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:34:59,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:34:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash 952489520, now seen corresponding path program 1 times [2024-11-22 12:34:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:34:59,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860927746] [2024-11-22 12:34:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:34:59,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:34:59,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:34:59,229 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:34:59,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-22 12:34:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:34:59,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 12:34:59,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:00,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:00,015 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 150 treesize of output 60 [2024-11-22 12:35:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-22 12:35:00,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:35:00,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:35:00,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860927746] [2024-11-22 12:35:00,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860927746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:35:00,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [834078033] [2024-11-22 12:35:00,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:00,327 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:35:00,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:35:00,328 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:35:00,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-22 12:35:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:01,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 12:35:01,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:02,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:02,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 60 [2024-11-22 12:35:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-22 12:35:02,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:35:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [834078033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:35:02,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:35:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-22 12:35:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112891031] [2024-11-22 12:35:02,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:35:02,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 12:35:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:35:02,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 12:35:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2024-11-22 12:35:02,873 INFO L87 Difference]: Start difference. First operand 1756 states and 2405 transitions. Second operand has 20 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-22 12:35:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:04,337 INFO L93 Difference]: Finished difference Result 2998 states and 4084 transitions. [2024-11-22 12:35:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 12:35:04,338 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 86 [2024-11-22 12:35:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:04,344 INFO L225 Difference]: With dead ends: 2998 [2024-11-22 12:35:04,345 INFO L226 Difference]: Without dead ends: 1245 [2024-11-22 12:35:04,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 12:35:04,349 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 365 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:04,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1716 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 12:35:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-11-22 12:35:04,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1183. [2024-11-22 12:35:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1054 states have (on average 1.3263757115749526) internal successors, (1398), 1066 states have internal predecessors, (1398), 108 states have call successors, (108), 20 states have call predecessors, (108), 20 states have return successors, (108), 96 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-22 12:35:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1614 transitions. [2024-11-22 12:35:04,416 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1614 transitions. Word has length 86 [2024-11-22 12:35:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:04,417 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1614 transitions. [2024-11-22 12:35:04,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-22 12:35:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1614 transitions. [2024-11-22 12:35:04,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 12:35:04,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:04,420 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:35:04,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-22 12:35:04,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-11-22 12:35:04,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 12:35:04,821 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:04,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1734425819, now seen corresponding path program 1 times [2024-11-22 12:35:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:35:04,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246071687] [2024-11-22 12:35:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:04,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:04,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:35:04,823 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:35:04,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-22 12:35:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:05,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:35:05,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-22 12:35:05,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:35:05,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:35:05,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246071687] [2024-11-22 12:35:05,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246071687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:05,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:35:05,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:35:05,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484266231] [2024-11-22 12:35:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:05,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:35:05,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:35:05,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:35:05,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:35:05,129 INFO L87 Difference]: Start difference. First operand 1183 states and 1614 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:35:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:05,288 INFO L93 Difference]: Finished difference Result 2293 states and 3111 transitions. [2024-11-22 12:35:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:35:05,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-11-22 12:35:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:05,295 INFO L225 Difference]: With dead ends: 2293 [2024-11-22 12:35:05,295 INFO L226 Difference]: Without dead ends: 1113 [2024-11-22 12:35:05,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:35:05,299 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 217 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:05,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 346 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:35:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-22 12:35:05,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 885. [2024-11-22 12:35:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 797 states have (on average 1.3161856963613552) internal successors, (1049), 804 states have internal predecessors, (1049), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 12:35:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1193 transitions. [2024-11-22 12:35:05,371 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1193 transitions. Word has length 87 [2024-11-22 12:35:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:05,372 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1193 transitions. [2024-11-22 12:35:05,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-22 12:35:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1193 transitions. [2024-11-22 12:35:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 12:35:05,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:05,374 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:35:05,382 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 (19)] Ended with exit code 0 [2024-11-22 12:35:05,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:05,575 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:05,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1380936289, now seen corresponding path program 1 times [2024-11-22 12:35:05,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:35:05,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938475193] [2024-11-22 12:35:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:05,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:35:05,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:35:05,577 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:35:05,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 12:35:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:05,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 12:35:05,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:05,962 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-11-22 12:35:06,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:06,904 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 121 treesize of output 77 [2024-11-22 12:35:10,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:10,913 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 193 treesize of output 125 [2024-11-22 12:35:11,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:35:11,358 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 337 treesize of output 127 [2024-11-22 12:35:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:35:11,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:35:11,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:35:11,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938475193] [2024-11-22 12:35:11,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938475193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:11,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:35:11,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 12:35:11,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861158716] [2024-11-22 12:35:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:11,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 12:35:11,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:35:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 12:35:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=191, Unknown=1, NotChecked=0, Total=240 [2024-11-22 12:35:11,542 INFO L87 Difference]: Start difference. First operand 885 states and 1193 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 12:35:14,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:35:19,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:35:22,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:35:25,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:35:28,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:35:31,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:35:34,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:35:37,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:35:41,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 12:35:44,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]