./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.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-28.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 f087c65c2f7683fdbf5894edd88b7aff773198dd31c450de1532cfa19090054a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:32:13,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:32:13,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:32:13,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:32:13,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:32:13,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:32:13,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:32:13,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:32:13,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:32:13,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:32:13,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:32:13,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:32:13,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:32:13,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:32:13,728 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:32:13,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:32:13,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:32:13,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:32:13,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:32:13,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:32:13,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:32:13,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:32:13,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:32:13,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:32:13,731 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:32:13,731 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:32:13,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:32:13,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:32:13,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:32:13,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:32:13,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:32:13,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:32:13,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:32:13,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:32:13,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:32:13,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:32:13,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:32:13,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:32:13,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:32:13,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:32:13,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:32:13,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:32:13,736 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 -> f087c65c2f7683fdbf5894edd88b7aff773198dd31c450de1532cfa19090054a [2024-11-22 12:32:13,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:32:13,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:32:13,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:32:13,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:32:13,942 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:32:13,943 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-28.i [2024-11-22 12:32:15,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:32:15,465 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:32:15,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i [2024-11-22 12:32:15,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c41ef97a/ad3a803749d746e68054386e4de90738/FLAG6dc053fa5 [2024-11-22 12:32:15,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c41ef97a/ad3a803749d746e68054386e4de90738 [2024-11-22 12:32:15,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:32:15,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:32:15,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:32:15,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:32:15,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:32:15,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:15,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50eb957a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15, skipping insertion in model container [2024-11-22 12:32:15,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:15,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:32:15,667 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-28.i[916,929] [2024-11-22 12:32:15,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:32:15,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:32:15,765 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-28.i[916,929] [2024-11-22 12:32:15,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:32:15,812 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:32:15,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15 WrapperNode [2024-11-22 12:32:15,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:32:15,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:32:15,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:32:15,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:32:15,844 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:32:15" (1/1) ... [2024-11-22 12:32:15,868 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:32:15" (1/1) ... [2024-11-22 12:32:15,953 INFO L138 Inliner]: procedures = 29, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 581 [2024-11-22 12:32:15,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:32:15,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:32:15,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:32:15,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:32:15,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:15,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:15,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:16,005 INFO L175 MemorySlicer]: Split 152 memory accesses to 6 slices as follows [2, 52, 59, 19, 3, 17]. 39 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 4, 3, 1, 1]. The 17 writes are split as follows [0, 6, 5, 4, 1, 1]. [2024-11-22 12:32:16,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:16,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:16,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:16,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:16,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:16,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:16,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:32:16,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:32:16,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:32:16,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:32:16,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (1/1) ... [2024-11-22 12:32:16,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:32:16,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:32:16,088 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:32:16,095 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:32:16,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:32:16,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:32:16,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:32:16,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:32:16,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:32:16,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:32:16,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-22 12:32:16,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:32:16,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:32:16,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:32:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:32:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:32:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-22 12:32:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:32:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:32:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:32:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:32:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:32:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-22 12:32:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:32:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:32:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:32:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:32:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:32:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-22 12:32:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:32:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:32:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:32:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:32:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:32:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-22 12:32:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:32:16,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:32:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:32:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:32:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:32:16,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:32:16,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:32:16,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-22 12:32:16,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:32:16,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:32:16,249 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:32:16,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:32:16,688 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2024-11-22 12:32:16,689 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:32:16,700 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:32:16,701 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:32:16,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:32:16 BoogieIcfgContainer [2024-11-22 12:32:16,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:32:16,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:32:16,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:32:16,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:32:16,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:32:15" (1/3) ... [2024-11-22 12:32:16,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bef563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:32:16, skipping insertion in model container [2024-11-22 12:32:16,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:15" (2/3) ... [2024-11-22 12:32:16,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bef563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:32:16, skipping insertion in model container [2024-11-22 12:32:16,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:32:16" (3/3) ... [2024-11-22 12:32:16,709 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-28.i [2024-11-22 12:32:16,723 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:32:16,724 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:32:16,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:32:16,787 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;@48f2e3d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:32:16,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:32:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-22 12:32:16,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:16,801 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:16,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:16,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash -811365307, now seen corresponding path program 1 times [2024-11-22 12:32:16,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:16,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358439766] [2024-11-22 12:32:16,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:16,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 12:32:17,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:32:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358439766] [2024-11-22 12:32:17,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358439766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:32:17,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723693478] [2024-11-22 12:32:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:17,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:32:17,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:32:17,096 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:32:17,097 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:32:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:17,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:32:17,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 12:32:17,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:32:17,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723693478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:17,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:32:17,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:32:17,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16874689] [2024-11-22 12:32:17,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:17,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:32:17,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:32:17,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:32:17,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:32:17,375 INFO L87 Difference]: Start difference. First operand has 123 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 12:32:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:17,397 INFO L93 Difference]: Finished difference Result 239 states and 368 transitions. [2024-11-22 12:32:17,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:32:17,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-22 12:32:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:17,404 INFO L225 Difference]: With dead ends: 239 [2024-11-22 12:32:17,404 INFO L226 Difference]: Without dead ends: 119 [2024-11-22 12:32:17,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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:32:17,410 INFO L432 NwaCegarLoop]: 171 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, 171 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:32:17,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:32:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-22 12:32:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-22 12:32:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-22 12:32:17,452 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 130 [2024-11-22 12:32:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:17,452 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-22 12:32:17,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 12:32:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-22 12:32:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-22 12:32:17,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:17,455 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:17,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 12:32:17,659 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:32:17,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:17,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:17,661 INFO L85 PathProgramCache]: Analyzing trace with hash -323615399, now seen corresponding path program 1 times [2024-11-22 12:32:17,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:17,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320499944] [2024-11-22 12:32:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:17,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:17,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:32:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320499944] [2024-11-22 12:32:17,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320499944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:17,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:17,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:32:17,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399236013] [2024-11-22 12:32:17,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:17,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:32:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:32:17,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:32:17,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:32:17,916 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:17,951 INFO L93 Difference]: Finished difference Result 238 states and 343 transitions. [2024-11-22 12:32:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:32:17,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-22 12:32:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:17,955 INFO L225 Difference]: With dead ends: 238 [2024-11-22 12:32:17,955 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 12:32:17,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:32:17,958 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:17,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:32:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 12:32:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-22 12:32:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2024-11-22 12:32:17,978 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 130 [2024-11-22 12:32:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:17,980 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2024-11-22 12:32:17,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-11-22 12:32:17,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-22 12:32:17,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:17,982 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:17,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:32:17,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:17,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1451391963, now seen corresponding path program 1 times [2024-11-22 12:32:17,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:17,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87336293] [2024-11-22 12:32:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:17,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:18,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:32:18,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87336293] [2024-11-22 12:32:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87336293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:18,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:18,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:32:18,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401172081] [2024-11-22 12:32:18,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:18,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:32:18,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:32:18,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:32:18,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:32:18,190 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:18,217 INFO L93 Difference]: Finished difference Result 242 states and 347 transitions. [2024-11-22 12:32:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:32:18,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-22 12:32:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:18,219 INFO L225 Difference]: With dead ends: 242 [2024-11-22 12:32:18,219 INFO L226 Difference]: Without dead ends: 124 [2024-11-22 12:32:18,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:32:18,221 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:18,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:32:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-22 12:32:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-22 12:32:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2024-11-22 12:32:18,231 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 130 [2024-11-22 12:32:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:18,232 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2024-11-22 12:32:18,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2024-11-22 12:32:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-22 12:32:18,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:18,234 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:18,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 12:32:18,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:18,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1453239005, now seen corresponding path program 1 times [2024-11-22 12:32:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:18,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650653637] [2024-11-22 12:32:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:18,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:32:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650653637] [2024-11-22 12:32:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650653637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:18,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:18,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:32:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769979153] [2024-11-22 12:32:18,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:18,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:32:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:32:18,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:32:18,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:32:18,737 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:18,888 INFO L93 Difference]: Finished difference Result 343 states and 489 transitions. [2024-11-22 12:32:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:32:18,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2024-11-22 12:32:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:18,890 INFO L225 Difference]: With dead ends: 343 [2024-11-22 12:32:18,892 INFO L226 Difference]: Without dead ends: 223 [2024-11-22 12:32:18,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:32:18,893 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 126 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:18,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 717 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:32:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-22 12:32:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2024-11-22 12:32:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 196 states have internal predecessors, (270), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 12:32:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 314 transitions. [2024-11-22 12:32:18,915 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 314 transitions. Word has length 130 [2024-11-22 12:32:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:18,916 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 314 transitions. [2024-11-22 12:32:18,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 314 transitions. [2024-11-22 12:32:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-22 12:32:18,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:18,917 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:18,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 12:32:18,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:18,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1718375793, now seen corresponding path program 1 times [2024-11-22 12:32:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:18,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223901961] [2024-11-22 12:32:18,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:19,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:32:19,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223901961] [2024-11-22 12:32:19,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223901961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:19,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:19,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:32:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303554273] [2024-11-22 12:32:19,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:19,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:32:19,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:32:19,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:32:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:32:19,055 INFO L87 Difference]: Start difference. First operand 220 states and 314 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:19,089 INFO L93 Difference]: Finished difference Result 443 states and 633 transitions. [2024-11-22 12:32:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:32:19,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-22 12:32:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:19,092 INFO L225 Difference]: With dead ends: 443 [2024-11-22 12:32:19,093 INFO L226 Difference]: Without dead ends: 226 [2024-11-22 12:32:19,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32:19,094 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 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:32:19,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:32:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-22 12:32:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-22 12:32:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.373134328358209) internal successors, (276), 202 states have internal predecessors, (276), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 12:32:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 320 transitions. [2024-11-22 12:32:19,102 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 320 transitions. Word has length 132 [2024-11-22 12:32:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:19,103 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 320 transitions. [2024-11-22 12:32:19,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 320 transitions. [2024-11-22 12:32:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-22 12:32:19,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:19,104 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:19,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:32:19,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:19,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash -485277064, now seen corresponding path program 1 times [2024-11-22 12:32:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:19,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303995218] [2024-11-22 12:32:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:19,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:32:19,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303995218] [2024-11-22 12:32:19,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303995218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:19,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:19,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 12:32:19,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133807469] [2024-11-22 12:32:19,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:19,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:32:19,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:32:19,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:32:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:32:19,551 INFO L87 Difference]: Start difference. First operand 226 states and 320 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:19,927 INFO L93 Difference]: Finished difference Result 857 states and 1213 transitions. [2024-11-22 12:32:19,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:32:19,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-22 12:32:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:19,930 INFO L225 Difference]: With dead ends: 857 [2024-11-22 12:32:19,931 INFO L226 Difference]: Without dead ends: 634 [2024-11-22 12:32:19,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:32:19,934 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 344 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:19,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1084 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:32:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-22 12:32:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2024-11-22 12:32:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 571 states have (on average 1.3922942206654991) internal successors, (795), 577 states have internal predecessors, (795), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-22 12:32:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 887 transitions. [2024-11-22 12:32:19,966 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 887 transitions. Word has length 132 [2024-11-22 12:32:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:19,966 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 887 transitions. [2024-11-22 12:32:19,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 887 transitions. [2024-11-22 12:32:19,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-22 12:32:19,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:19,968 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:19,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 12:32:19,968 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:19,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:19,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1506345418, now seen corresponding path program 1 times [2024-11-22 12:32:19,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:19,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359046937] [2024-11-22 12:32:19,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:19,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:20,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:32:20,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359046937] [2024-11-22 12:32:20,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359046937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:20,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:20,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:32:20,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940061174] [2024-11-22 12:32:20,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:20,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:32:20,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:32:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:32:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:32:20,226 INFO L87 Difference]: Start difference. First operand 625 states and 887 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:20,396 INFO L93 Difference]: Finished difference Result 1226 states and 1735 transitions. [2024-11-22 12:32:20,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:32:20,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-22 12:32:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:20,400 INFO L225 Difference]: With dead ends: 1226 [2024-11-22 12:32:20,400 INFO L226 Difference]: Without dead ends: 637 [2024-11-22 12:32:20,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:32:20,401 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 135 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:20,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 496 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:32:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-22 12:32:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2024-11-22 12:32:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 576 states have (on average 1.3854166666666667) internal successors, (798), 582 states have internal predecessors, (798), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:32:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 894 transitions. [2024-11-22 12:32:20,429 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 894 transitions. Word has length 132 [2024-11-22 12:32:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:20,429 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 894 transitions. [2024-11-22 12:32:20,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 894 transitions. [2024-11-22 12:32:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:32:20,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:20,431 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:20,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 12:32:20,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:20,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1286711507, now seen corresponding path program 1 times [2024-11-22 12:32:20,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:20,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007802159] [2024-11-22 12:32:20,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:20,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:20,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:32:20,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007802159] [2024-11-22 12:32:20,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007802159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:20,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:20,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:32:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054952127] [2024-11-22 12:32:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:20,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:32:20,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:32:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:32:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:32:20,872 INFO L87 Difference]: Start difference. First operand 633 states and 894 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 12:32:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:21,298 INFO L93 Difference]: Finished difference Result 1263 states and 1780 transitions. [2024-11-22 12:32:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:32:21,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2024-11-22 12:32:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:21,302 INFO L225 Difference]: With dead ends: 1263 [2024-11-22 12:32:21,303 INFO L226 Difference]: Without dead ends: 674 [2024-11-22 12:32:21,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:32:21,305 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 479 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:21,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 748 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:32:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-22 12:32:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 661. [2024-11-22 12:32:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 592 states have (on average 1.3682432432432432) internal successors, (810), 598 states have internal predecessors, (810), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-22 12:32:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 926 transitions. [2024-11-22 12:32:21,337 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 926 transitions. Word has length 134 [2024-11-22 12:32:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:21,337 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 926 transitions. [2024-11-22 12:32:21,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 12:32:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 926 transitions. [2024-11-22 12:32:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:32:21,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:21,339 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:21,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 12:32:21,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:21,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash 469063057, now seen corresponding path program 1 times [2024-11-22 12:32:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:21,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273888447] [2024-11-22 12:32:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:21,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 12:32:21,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:32:21,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273888447] [2024-11-22 12:32:21,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273888447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:32:21,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20248448] [2024-11-22 12:32:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:21,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:32:21,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:32:21,753 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:32:21,755 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:32:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:21,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 12:32:21,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:22,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:32:22,096 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 42 treesize of output 38 [2024-11-22 12:32:22,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:32:22,239 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 47 treesize of output 17 [2024-11-22 12:32:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 189 proven. 15 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-22 12:32:22,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:32:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 12:32:22,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20248448] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:32:22,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 12:32:22,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 27 [2024-11-22 12:32:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562789934] [2024-11-22 12:32:22,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 12:32:22,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-22 12:32:22,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:32:22,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-22 12:32:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2024-11-22 12:32:22,576 INFO L87 Difference]: Start difference. First operand 661 states and 926 transitions. Second operand has 27 states, 24 states have (on average 5.833333333333333) internal successors, (140), 27 states have internal predecessors, (140), 8 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 5 states have call predecessors, (34), 8 states have call successors, (34) [2024-11-22 12:32:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:23,491 INFO L93 Difference]: Finished difference Result 896 states and 1252 transitions. [2024-11-22 12:32:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 12:32:23,491 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 5.833333333333333) internal successors, (140), 27 states have internal predecessors, (140), 8 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 5 states have call predecessors, (34), 8 states have call successors, (34) Word has length 134 [2024-11-22 12:32:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:23,493 INFO L225 Difference]: With dead ends: 896 [2024-11-22 12:32:23,493 INFO L226 Difference]: Without dead ends: 279 [2024-11-22 12:32:23,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1283, Unknown=0, NotChecked=0, Total=1560 [2024-11-22 12:32:23,494 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 389 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:23,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1228 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 12:32:23,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-22 12:32:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2024-11-22 12:32:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 243 states have (on average 1.353909465020576) internal successors, (329), 245 states have internal predecessors, (329), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 12:32:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 385 transitions. [2024-11-22 12:32:23,506 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 385 transitions. Word has length 134 [2024-11-22 12:32:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:23,506 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 385 transitions. [2024-11-22 12:32:23,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 5.833333333333333) internal successors, (140), 27 states have internal predecessors, (140), 8 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 5 states have call predecessors, (34), 8 states have call successors, (34) [2024-11-22 12:32:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 385 transitions. [2024-11-22 12:32:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:32:23,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:23,508 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:23,519 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:32:23,710 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,SelfDestructingSolverStorable8 [2024-11-22 12:32:23,711 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:23,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1404216323, now seen corresponding path program 1 times [2024-11-22 12:32:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:23,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062689888] [2024-11-22 12:32:23,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:23,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:32:23,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062689888] [2024-11-22 12:32:23,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062689888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:23,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:23,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:32:23,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110461342] [2024-11-22 12:32:23,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:23,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:32:23,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:32:23,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:32:23,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:32:23,895 INFO L87 Difference]: Start difference. First operand 279 states and 385 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:23,927 INFO L93 Difference]: Finished difference Result 514 states and 710 transitions. [2024-11-22 12:32:23,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:32:23,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-22 12:32:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:23,930 INFO L225 Difference]: With dead ends: 514 [2024-11-22 12:32:23,930 INFO L226 Difference]: Without dead ends: 279 [2024-11-22 12:32:23,931 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:32:23,931 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:23,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:32:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-22 12:32:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2024-11-22 12:32:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 243 states have (on average 1.345679012345679) internal successors, (327), 245 states have internal predecessors, (327), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 12:32:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 383 transitions. [2024-11-22 12:32:23,949 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 383 transitions. Word has length 134 [2024-11-22 12:32:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:23,950 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 383 transitions. [2024-11-22 12:32:23,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 383 transitions. [2024-11-22 12:32:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:32:23,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:23,952 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:23,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 12:32:23,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2073102523, now seen corresponding path program 1 times [2024-11-22 12:32:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:32:23,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678043722] [2024-11-22 12:32:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:23,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:32:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:32:24,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:32:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:32:24,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:32:24,138 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:32:24,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:32:24,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 12:32:24,143 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:32:24,222 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:32:24,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:32:24 BoogieIcfgContainer [2024-11-22 12:32:24,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:32:24,227 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:32:24,227 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:32:24,227 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:32:24,228 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:32:16" (3/4) ... [2024-11-22 12:32:24,229 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:32:24,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:32:24,236 INFO L158 Benchmark]: Toolchain (without parser) took 8745.46ms. Allocated memory was 176.2MB in the beginning and 415.2MB in the end (delta: 239.1MB). Free memory was 106.4MB in the beginning and 254.4MB in the end (delta: -148.0MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2024-11-22 12:32:24,236 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 176.2MB. Free memory was 132.5MB in the beginning and 132.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:32:24,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.75ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 88.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 12:32:24,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.87ms. Allocated memory is still 176.2MB. Free memory was 88.4MB in the beginning and 143.7MB in the end (delta: -55.3MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-22 12:32:24,236 INFO L158 Benchmark]: Boogie Preprocessor took 90.70ms. Allocated memory is still 176.2MB. Free memory was 143.7MB in the beginning and 138.2MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:32:24,236 INFO L158 Benchmark]: RCFGBuilder took 656.05ms. Allocated memory is still 176.2MB. Free memory was 138.2MB in the beginning and 99.0MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-22 12:32:24,237 INFO L158 Benchmark]: TraceAbstraction took 7520.81ms. Allocated memory was 176.2MB in the beginning and 415.2MB in the end (delta: 239.1MB). Free memory was 98.3MB in the beginning and 254.4MB in the end (delta: -156.1MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2024-11-22 12:32:24,237 INFO L158 Benchmark]: Witness Printer took 8.32ms. Allocated memory is still 415.2MB. Free memory is still 254.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:32:24,238 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.65ms. Allocated memory is still 176.2MB. Free memory was 132.5MB in the beginning and 132.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.75ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 88.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.87ms. Allocated memory is still 176.2MB. Free memory was 88.4MB in the beginning and 143.7MB in the end (delta: -55.3MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.70ms. Allocated memory is still 176.2MB. Free memory was 143.7MB in the beginning and 138.2MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 656.05ms. Allocated memory is still 176.2MB. Free memory was 138.2MB in the beginning and 99.0MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7520.81ms. Allocated memory was 176.2MB in the beginning and 415.2MB in the end (delta: 239.1MB). Free memory was 98.3MB in the beginning and 254.4MB in the end (delta: -156.1MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. * Witness Printer took 8.32ms. Allocated memory is still 415.2MB. Free memory is still 254.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 0 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 0 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; VAL [float_Array_0={4:0}, isInitial=0, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L60] float_Array_0[0][0] = __VERIFIER_nondet_float() [L61] EXPR float_Array_0[0][0] [L61] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L61] EXPR float_Array_0[0][0] [L61] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] float_Array_0[0][1] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[0][1] [L63] EXPR float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F [L63] EXPR float_Array_0[0][1] [L63] EXPR float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR (float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR (float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] float_Array_0[0][2] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[0][2] [L65] EXPR float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F [L65] EXPR float_Array_0[0][2] [L65] EXPR float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR (float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR (float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not((float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not((float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] float_Array_0[1][2] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[1][2] [L67] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F [L67] EXPR float_Array_0[1][2] [L67] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR (float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR (float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] CALL assume_abort_if_not((float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] RET assume_abort_if_not((float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L69] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L72] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 126) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L75] EXPR signed_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -1) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] EXPR signed_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] signed_long_int_Array_0[1] = __VERIFIER_nondet_long() [L78] EXPR signed_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_long_int_Array_0[1] >= 1073741822) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_long_int_Array_0[1] >= 1073741822) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR signed_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483646) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483646) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] signed_long_int_Array_0[2] = __VERIFIER_nondet_long() [L81] EXPR signed_long_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[2] >= 1073741823) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[2] >= 1073741823) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR signed_long_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[2] <= 2147483646) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not(signed_long_int_Array_0[2] <= 2147483646) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET updateVariables() [L96] CALL step() [L40] signed long int stepLocal_0 = -4; [L41] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L41] COND TRUE stepLocal_0 < signed_char_Array_0[1][0] [L42] EXPR float_Array_0[0][0] [L42] EXPR float_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L42] EXPR ((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) [L42] EXPR float_Array_0[0][0] [L42] EXPR ((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L42] float_Array_0[1][0] = ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))) [L44] EXPR float_Array_0[0][0] [L44] EXPR float_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) [L44] EXPR float_Array_0[0][0] [L44] EXPR ((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] float_Array_0[1][1] = ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))) [L45] EXPR signed_char_Array_0[0][1] [L45] signed_short_int_Array_0[0] = signed_char_Array_0[0][1] [L46] EXPR signed_char_Array_0[1][0] [L46] unsigned_short_int_Array_0[0] = signed_char_Array_0[1][0] [L47] EXPR float_Array_0[1][2] [L47] EXPR float_Array_0[0][2] [L47] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L47] COND FALSE !((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) [L50] EXPR signed_char_Array_0[0][1] [L50] signed_char_Array_0[1][1] = signed_char_Array_0[0][1] [L52] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR signed_char_Array_0[1][0] | 5 VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] signed long int stepLocal_1 = signed_char_Array_0[1][0] | 5; [L53] EXPR signed_char_Array_0[0][1] [L53] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] EXPR ((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]) [L53] EXPR signed_char_Array_0[0][1] [L53] EXPR ((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=5, unsigned_short_int_Array_0={8:0}] [L53] COND FALSE !(stepLocal_1 <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) [L56] EXPR signed_char_Array_0[1][0] [L56] EXPR unsigned_short_int_Array_0[0] [L56] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L56] EXPR unsigned_short_int_Array_0[0] [L56] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR unsigned_short_int_Array_0[0] [L56] signed_long_int_Array_0[0] = (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])) [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR float_Array_0[1][2] [L87] EXPR float_Array_0[0][2] [L87] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) [L87] EXPR signed_char_Array_0[1][1] [L87] EXPR signed_char_Array_0[0][1] [L87] EXPR signed_char_Array_0[1][0] [L87] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]) [L87] EXPR signed_char_Array_0[0][1] [L87] EXPR signed_char_Array_0[1][0] [L87] EXPR (((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])))))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])))))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])))))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[1][0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])))))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[1][0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87-L88] return (((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])))))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[1][0])) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 11, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1475 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1475 mSDsluCounter, 6409 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4764 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2865 IncrementalHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 1645 mSDtfsCounter, 2865 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 483 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=661occurred in iteration=8, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 31 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1716 NumberOfCodeBlocks, 1716 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1703 ConstructedInterpolants, 0 QuantifiedInterpolants, 4213 SizeOfPredicates, 4 NumberOfNonLiveVariables, 982 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 4655/4732 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:32:24,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-28.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 f087c65c2f7683fdbf5894edd88b7aff773198dd31c450de1532cfa19090054a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:32:26,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:32:26,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:32:26,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:32:26,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:32:26,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:32:26,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:32:26,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:32:26,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:32:26,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:32:26,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:32:26,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:32:26,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:32:26,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:32:26,378 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:32:26,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:32:26,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:32:26,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:32:26,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:32:26,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:32:26,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:32:26,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:32:26,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:32:26,384 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:32:26,385 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:32:26,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:32:26,385 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:32:26,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:32:26,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:32:26,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:32:26,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:32:26,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:32:26,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:32:26,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:32:26,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:32:26,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:32:26,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:32:26,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:32:26,399 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:32:26,399 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:32:26,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:32:26,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:32:26,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:32:26,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:32:26,400 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 -> f087c65c2f7683fdbf5894edd88b7aff773198dd31c450de1532cfa19090054a [2024-11-22 12:32:26,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:32:26,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:32:26,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:32:26,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:32:26,678 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:32:26,679 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-28.i [2024-11-22 12:32:28,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:32:28,202 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:32:28,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i [2024-11-22 12:32:28,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319ea3d4b/9cb2cc04364246ddb1723cf9e7e41e2b/FLAG72aacd864 [2024-11-22 12:32:28,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319ea3d4b/9cb2cc04364246ddb1723cf9e7e41e2b [2024-11-22 12:32:28,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:32:28,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:32:28,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:32:28,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:32:28,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:32:28,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e74f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28, skipping insertion in model container [2024-11-22 12:32:28,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:32:28,430 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-28.i[916,929] [2024-11-22 12:32:28,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:32:28,515 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:32:28,525 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-28.i[916,929] [2024-11-22 12:32:28,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:32:28,611 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:32:28,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28 WrapperNode [2024-11-22 12:32:28,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:32:28,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:32:28,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:32:28,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:32:28,618 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:32:28" (1/1) ... [2024-11-22 12:32:28,639 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:32:28" (1/1) ... [2024-11-22 12:32:28,683 INFO L138 Inliner]: procedures = 36, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 559 [2024-11-22 12:32:28,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:32:28,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:32:28,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:32:28,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:32:28,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,743 INFO L175 MemorySlicer]: Split 152 memory accesses to 6 slices as follows [2, 52, 59, 19, 3, 17]. 39 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 4, 3, 1, 1]. The 17 writes are split as follows [0, 6, 5, 4, 1, 1]. [2024-11-22 12:32:28,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:32:28,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:32:28,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:32:28,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:32:28,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (1/1) ... [2024-11-22 12:32:28,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:32:28,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:32:28,834 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:32:28,839 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:32:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:32:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:32:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:32:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:32:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:32:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:32:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-22 12:32:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-22 12:32:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-22 12:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-22 12:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-22 12:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-22 12:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-22 12:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:32:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:32:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:32:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-22 12:32:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 12:32:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 12:32:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 12:32:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 12:32:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-22 12:32:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-22 12:32:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-22 12:32:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-22 12:32:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-22 12:32:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-22 12:32:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-22 12:32:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-22 12:32:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 12:32:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 12:32:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 12:32:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 12:32:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-22 12:32:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-22 12:32:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 12:32:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 12:32:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-22 12:32:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-22 12:32:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-22 12:32:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-22 12:32:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-22 12:32:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-22 12:32:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-22 12:32:28,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-22 12:32:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-22 12:32:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-22 12:32:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-22 12:32:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-22 12:32:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-22 12:32:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-22 12:32:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-22 12:32:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-22 12:32:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:32:28,875 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:32:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:32:28,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:32:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:32:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:32:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:32:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:32:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:32:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-22 12:32:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 12:32:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 12:32:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-22 12:32:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-22 12:32:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-22 12:32:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-22 12:32:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 12:32:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 12:32:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 12:32:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 12:32:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-22 12:32:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-22 12:32:29,027 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:32:29,029 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:32:29,736 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-22 12:32:29,736 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:32:29,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:32:29,756 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:32:29,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:32:29 BoogieIcfgContainer [2024-11-22 12:32:29,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:32:29,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:32:29,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:32:29,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:32:29,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:32:28" (1/3) ... [2024-11-22 12:32:29,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4f3477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:32:29, skipping insertion in model container [2024-11-22 12:32:29,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:32:28" (2/3) ... [2024-11-22 12:32:29,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4f3477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:32:29, skipping insertion in model container [2024-11-22 12:32:29,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:32:29" (3/3) ... [2024-11-22 12:32:29,762 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-28.i [2024-11-22 12:32:29,775 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:32:29,775 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:32:29,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:32:29,827 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;@110c7e1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:32:29,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:32:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-22 12:32:29,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:29,840 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:29,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:29,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1002233096, now seen corresponding path program 1 times [2024-11-22 12:32:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:29,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336104361] [2024-11-22 12:32:29,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:29,855 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:32:29,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:29,857 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:32:29,858 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:32:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:30,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:32:30,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-22 12:32:30,244 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:32:30,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:30,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336104361] [2024-11-22 12:32:30,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336104361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:30,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:30,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:32:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864031568] [2024-11-22 12:32:30,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:30,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:32:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:30,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:32:30,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:32:30,280 INFO L87 Difference]: Start difference. First operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 12:32:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:30,303 INFO L93 Difference]: Finished difference Result 223 states and 344 transitions. [2024-11-22 12:32:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:32:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-22 12:32:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:30,310 INFO L225 Difference]: With dead ends: 223 [2024-11-22 12:32:30,310 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 12:32:30,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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:32:30,316 INFO L432 NwaCegarLoop]: 161 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, 161 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:32:30,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:32:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 12:32:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-22 12:32:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-11-22 12:32:30,348 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 128 [2024-11-22 12:32:30,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:30,349 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-11-22 12:32:30,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 12:32:30,349 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-11-22 12:32:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-22 12:32:30,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:30,353 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:30,364 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 (2)] Forceful destruction successful, exit code 0 [2024-11-22 12:32:30,554 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:32:30,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:30,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:30,556 INFO L85 PathProgramCache]: Analyzing trace with hash 864193308, now seen corresponding path program 1 times [2024-11-22 12:32:30,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:30,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758530682] [2024-11-22 12:32:30,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:30,557 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:32:30,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:30,560 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:32:30,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 12:32:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:30,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 12:32:30,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:30,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:32:30,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:30,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758530682] [2024-11-22 12:32:30,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758530682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:30,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:32:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757195597] [2024-11-22 12:32:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:30,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:32:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:32:30,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:32:30,966 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:31,040 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2024-11-22 12:32:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:32:31,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2024-11-22 12:32:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:31,043 INFO L225 Difference]: With dead ends: 226 [2024-11-22 12:32:31,044 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 12:32:31,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:32:31,046 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:31,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 749 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:32:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 12:32:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-22 12:32:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2024-11-22 12:32:31,065 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 128 [2024-11-22 12:32:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:31,066 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2024-11-22 12:32:31,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2024-11-22 12:32:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-22 12:32:31,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:31,070 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:31,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 12:32:31,273 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:32:31,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:31,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1655766626, now seen corresponding path program 1 times [2024-11-22 12:32:31,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:31,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176886920] [2024-11-22 12:32:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:31,277 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:32:31,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:31,280 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:32:31,281 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:32:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:31,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:32:31,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:31,768 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 95 treesize of output 41 [2024-11-22 12:32:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-22 12:32:31,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:32:31,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176886920] [2024-11-22 12:32:31,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176886920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:31,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:31,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:32:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130746502] [2024-11-22 12:32:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:31,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:32:31,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:31,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:32:31,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:32:31,829 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 12:32:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:32,458 INFO L93 Difference]: Finished difference Result 232 states and 332 transitions. [2024-11-22 12:32:32,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:32:32,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-22 12:32:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:32,459 INFO L225 Difference]: With dead ends: 232 [2024-11-22 12:32:32,459 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 12:32:32,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:32:32,461 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 141 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:32,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 507 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 12:32:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 12:32:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-22 12:32:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-22 12:32:32,468 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 128 [2024-11-22 12:32:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:32,468 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-22 12:32:32,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 12:32:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-22 12:32:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-22 12:32:32,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:32,470 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:32,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 12:32:32,670 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:32:32,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:32,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1165533540, now seen corresponding path program 1 times [2024-11-22 12:32:32,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:32,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150678301] [2024-11-22 12:32:32,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:32,674 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:32:32,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:32,677 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:32:32,683 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:32:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:32,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:32:32,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:33,055 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 95 treesize of output 41 [2024-11-22 12:32:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-22 12:32:33,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:32:33,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150678301] [2024-11-22 12:32:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150678301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:33,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:32:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547115059] [2024-11-22 12:32:33,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:33,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:32:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:33,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:32:33,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:32:33,106 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 12:32:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:33,623 INFO L93 Difference]: Finished difference Result 232 states and 330 transitions. [2024-11-22 12:32:33,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:32:33,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-22 12:32:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:33,628 INFO L225 Difference]: With dead ends: 232 [2024-11-22 12:32:33,628 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 12:32:33,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:32:33,630 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 132 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:33,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 502 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:32:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 12:32:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-22 12:32:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2024-11-22 12:32:33,635 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 130 [2024-11-22 12:32:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:33,636 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2024-11-22 12:32:33,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 12:32:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2024-11-22 12:32:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-22 12:32:33,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:33,637 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:33,647 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:32:33,841 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:32:33,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:33,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:33,842 INFO L85 PathProgramCache]: Analyzing trace with hash 82853470, now seen corresponding path program 1 times [2024-11-22 12:32:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:33,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995237741] [2024-11-22 12:32:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:33,843 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:32:33,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:33,845 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:32:33,849 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:32:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:34,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 12:32:34,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:34,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-22 12:32:34,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 12:32:34,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 12:32:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:34,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:32:34,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:34,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995237741] [2024-11-22 12:32:34,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995237741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:34,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:34,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:32:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170089054] [2024-11-22 12:32:34,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:34,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:32:34,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:34,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:32:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:32:34,286 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:35,331 INFO L93 Difference]: Finished difference Result 355 states and 500 transitions. [2024-11-22 12:32:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:32:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2024-11-22 12:32:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:35,334 INFO L225 Difference]: With dead ends: 355 [2024-11-22 12:32:35,334 INFO L226 Difference]: Without dead ends: 241 [2024-11-22 12:32:35,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:32:35,335 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 252 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:35,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 861 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 12:32:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-22 12:32:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 228. [2024-11-22 12:32:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 196 states have (on average 1.3520408163265305) internal successors, (265), 197 states have internal predecessors, (265), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 12:32:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 321 transitions. [2024-11-22 12:32:35,354 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 321 transitions. Word has length 132 [2024-11-22 12:32:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:35,354 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 321 transitions. [2024-11-22 12:32:35,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 321 transitions. [2024-11-22 12:32:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-22 12:32:35,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:35,356 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:35,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 12:32:35,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:32:35,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:35,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:35,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1911291236, now seen corresponding path program 1 times [2024-11-22 12:32:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:35,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148557279] [2024-11-22 12:32:35,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:35,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:32:35,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:35,566 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:32:35,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 12:32:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:35,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 12:32:35,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:35,956 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:32:36,007 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 31 treesize of output 15 [2024-11-22 12:32:36,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-22 12:32:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 193 proven. 21 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-22 12:32:36,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:32:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 12:32:36,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:36,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148557279] [2024-11-22 12:32:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148557279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:32:36,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:32:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-22 12:32:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238207140] [2024-11-22 12:32:36,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:32:36,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 12:32:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 12:32:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:32:36,375 INFO L87 Difference]: Start difference. First operand 228 states and 321 transitions. Second operand has 12 states, 10 states have (on average 8.5) internal successors, (85), 12 states have internal predecessors, (85), 5 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 3 states have call predecessors, (22), 5 states have call successors, (22) [2024-11-22 12:32:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:37,116 INFO L93 Difference]: Finished difference Result 346 states and 486 transitions. [2024-11-22 12:32:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 12:32:37,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.5) internal successors, (85), 12 states have internal predecessors, (85), 5 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 3 states have call predecessors, (22), 5 states have call successors, (22) Word has length 132 [2024-11-22 12:32:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:37,118 INFO L225 Difference]: With dead ends: 346 [2024-11-22 12:32:37,118 INFO L226 Difference]: Without dead ends: 121 [2024-11-22 12:32:37,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-22 12:32:37,119 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 234 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:37,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 579 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 12:32:37,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-22 12:32:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-22 12:32:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 167 transitions. [2024-11-22 12:32:37,126 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 167 transitions. Word has length 132 [2024-11-22 12:32:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:37,126 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 167 transitions. [2024-11-22 12:32:37,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.5) internal successors, (85), 12 states have internal predecessors, (85), 5 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 3 states have call predecessors, (22), 5 states have call successors, (22) [2024-11-22 12:32:37,127 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 167 transitions. [2024-11-22 12:32:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:32:37,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:37,128 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:37,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 12:32:37,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:32:37,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:37,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1589832605, now seen corresponding path program 1 times [2024-11-22 12:32:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:37,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656412133] [2024-11-22 12:32:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:37,334 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:32:37,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:37,336 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:32:37,337 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:32:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:37,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 12:32:37,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:37,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-22 12:32:37,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 12:32:37,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 12:32:37,947 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:37,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:32:37,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:37,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656412133] [2024-11-22 12:32:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656412133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:37,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:32:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681569868] [2024-11-22 12:32:37,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:37,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:32:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:37,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:32:37,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:32:37,949 INFO L87 Difference]: Start difference. First operand 121 states and 167 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:38,039 INFO L93 Difference]: Finished difference Result 239 states and 331 transitions. [2024-11-22 12:32:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:32:38,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-22 12:32:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:38,041 INFO L225 Difference]: With dead ends: 239 [2024-11-22 12:32:38,041 INFO L226 Difference]: Without dead ends: 121 [2024-11-22 12:32:38,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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:32:38,042 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 152 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:38,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 286 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:32:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-22 12:32:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-22 12:32:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 104 states have internal predecessors, (138), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 166 transitions. [2024-11-22 12:32:38,050 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 166 transitions. Word has length 134 [2024-11-22 12:32:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:38,050 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 166 transitions. [2024-11-22 12:32:38,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 166 transitions. [2024-11-22 12:32:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:32:38,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:38,051 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:38,066 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:32:38,251 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:32:38,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:38,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:38,252 INFO L85 PathProgramCache]: Analyzing trace with hash 710989985, now seen corresponding path program 1 times [2024-11-22 12:32:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:38,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399131490] [2024-11-22 12:32:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:38,253 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:32:38,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:38,255 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:32:38,257 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:32:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:38,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 12:32:38,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:38,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:32:38,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-22 12:32:39,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:32:39,244 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 128 treesize of output 65 [2024-11-22 12:32:39,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:32:39,393 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 128 treesize of output 65 [2024-11-22 12:32:40,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:32:40,469 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 119 treesize of output 56 [2024-11-22 12:32:40,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:32:40,487 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 148 treesize of output 58 [2024-11-22 12:32:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 12:32:40,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:32:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:40,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:40,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399131490] [2024-11-22 12:32:40,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399131490] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:32:40,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:32:40,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-22 12:32:40,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578194863] [2024-11-22 12:32:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:40,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:32:40,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:40,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:32:40,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-22 12:32:40,824 INFO L87 Difference]: Start difference. First operand 121 states and 166 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:41,113 INFO L93 Difference]: Finished difference Result 298 states and 410 transitions. [2024-11-22 12:32:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:32:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-22 12:32:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:41,115 INFO L225 Difference]: With dead ends: 298 [2024-11-22 12:32:41,115 INFO L226 Difference]: Without dead ends: 180 [2024-11-22 12:32:41,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-22 12:32:41,116 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 146 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:41,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 406 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:32:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-22 12:32:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 124. [2024-11-22 12:32:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 107 states have internal predecessors, (141), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 12:32:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 169 transitions. [2024-11-22 12:32:41,123 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 169 transitions. Word has length 134 [2024-11-22 12:32:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:41,124 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 169 transitions. [2024-11-22 12:32:41,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 169 transitions. [2024-11-22 12:32:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:32:41,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:41,125 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:41,137 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:32:41,329 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:32:41,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:41,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:41,331 INFO L85 PathProgramCache]: Analyzing trace with hash 576976479, now seen corresponding path program 1 times [2024-11-22 12:32:41,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:41,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773673416] [2024-11-22 12:32:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:41,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:32:41,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:41,334 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:32:41,336 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:32:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:41,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 12:32:41,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:41,819 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:32:41,823 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 21 treesize of output 21 [2024-11-22 12:32:41,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:32:41,868 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 66 treesize of output 30 [2024-11-22 12:32:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:41,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:32:41,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:41,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773673416] [2024-11-22 12:32:41,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773673416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:41,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:32:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303390091] [2024-11-22 12:32:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:41,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:32:41,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:41,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:32:41,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:32:41,881 INFO L87 Difference]: Start difference. First operand 124 states and 169 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:42,444 INFO L93 Difference]: Finished difference Result 343 states and 469 transitions. [2024-11-22 12:32:42,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:32:42,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2024-11-22 12:32:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:42,446 INFO L225 Difference]: With dead ends: 343 [2024-11-22 12:32:42,446 INFO L226 Difference]: Without dead ends: 222 [2024-11-22 12:32:42,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:32:42,447 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 115 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:32:42,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 663 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:32:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-22 12:32:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2024-11-22 12:32:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 192 states have (on average 1.3333333333333333) internal successors, (256), 193 states have internal predecessors, (256), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 12:32:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 300 transitions. [2024-11-22 12:32:42,458 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 300 transitions. Word has length 134 [2024-11-22 12:32:42,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:42,458 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 300 transitions. [2024-11-22 12:32:42,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 300 transitions. [2024-11-22 12:32:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-22 12:32:42,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:42,461 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:42,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 12:32:42,664 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:32:42,665 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:42,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2138313551, now seen corresponding path program 1 times [2024-11-22 12:32:42,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:42,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916885352] [2024-11-22 12:32:42,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:42,666 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:32:42,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:42,669 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:32:42,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 12:32:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:32:43,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:32:43,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:32:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:32:43,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:32:43,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:32:43,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916885352] [2024-11-22 12:32:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916885352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:32:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:32:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:32:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145982155] [2024-11-22 12:32:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:32:43,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:32:43,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:32:43,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:32:43,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:32:43,046 INFO L87 Difference]: Start difference. First operand 219 states and 300 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:32:43,106 INFO L93 Difference]: Finished difference Result 441 states and 605 transitions. [2024-11-22 12:32:43,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:32:43,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 136 [2024-11-22 12:32:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:32:43,108 INFO L225 Difference]: With dead ends: 441 [2024-11-22 12:32:43,108 INFO L226 Difference]: Without dead ends: 225 [2024-11-22 12:32:43,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 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:32:43,113 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 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:32:43,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:32:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-22 12:32:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-11-22 12:32:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 198 states have (on average 1.3232323232323233) internal successors, (262), 199 states have internal predecessors, (262), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 12:32:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 306 transitions. [2024-11-22 12:32:43,134 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 306 transitions. Word has length 136 [2024-11-22 12:32:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:32:43,134 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 306 transitions. [2024-11-22 12:32:43,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 12:32:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 306 transitions. [2024-11-22 12:32:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-22 12:32:43,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:32:43,136 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:43,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-22 12:32:43,336 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:32:43,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:32:43,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:32:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash -905214822, now seen corresponding path program 1 times [2024-11-22 12:32:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:32:43,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386580082] [2024-11-22 12:32:43,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:32:43,338 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:32:43,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:32:43,342 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:32:43,343 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