/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:13:15,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:13:15,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:13:15,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:13:15,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:13:15,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:13:15,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:13:15,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:13:15,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:13:15,261 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:13:15,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:13:15,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:13:15,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:13:15,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:13:15,263 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:13:15,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:13:15,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:13:15,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:13:15,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:13:15,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:13:15,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:13:15,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:13:15,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:13:15,265 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:13:15,265 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:13:15,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:13:15,266 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:13:15,266 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:13:15,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:13:15,266 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:13:15,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:13:15,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:13:15,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:13:15,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:13:15,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:13:15,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:13:15,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:13:15,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:13:15,268 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:13:15,269 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:13:15,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:13:15,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:13:15,269 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:13:15,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:13:15,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:13:15,270 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:13:15,270 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 [2023-12-16 16:13:15,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:13:15,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:13:15,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:13:15,482 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:13:15,482 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:13:15,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort-1.i [2023-12-16 16:13:16,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:13:16,637 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:13:16,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-1.i [2023-12-16 16:13:16,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c82215ca/8e3cb71a46d94f2ab23074ed7eef5a90/FLAG33b4b1881 [2023-12-16 16:13:16,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c82215ca/8e3cb71a46d94f2ab23074ed7eef5a90 [2023-12-16 16:13:16,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:13:16,665 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:13:16,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:13:16,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:13:16,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:13:16,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:16,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b6f30ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16, skipping insertion in model container [2023-12-16 16:13:16,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:16,704 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:13:16,888 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-1.i[22632,22645] [2023-12-16 16:13:16,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:13:16,928 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:13:16,954 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-1.i[22632,22645] [2023-12-16 16:13:16,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:13:16,990 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:13:16,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16 WrapperNode [2023-12-16 16:13:16,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:13:16,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:13:16,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:13:16,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:13:16,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,032 INFO L138 Inliner]: procedures = 128, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 287 [2023-12-16 16:13:17,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:13:17,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:13:17,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:13:17,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:13:17,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,095 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 34, 10, 3]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 8, 3, 2]. [2023-12-16 16:13:17,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:13:17,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:13:17,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:13:17,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:13:17,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (1/1) ... [2023-12-16 16:13:17,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:13:17,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:13:17,213 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) [2023-12-16 16:13:17,232 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 [2023-12-16 16:13:17,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:13:17,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:13:17,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 16:13:17,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-16 16:13:17,239 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2023-12-16 16:13:17,239 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2023-12-16 16:13:17,239 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-12-16 16:13:17,239 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-12-16 16:13:17,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:13:17,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:13:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 16:13:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-16 16:13:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:13:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:13:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:13:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:13:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 16:13:17,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:13:17,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:13:17,361 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:13:17,362 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:13:17,985 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:13:18,009 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:13:18,009 INFO L309 CfgBuilder]: Removed 33 assume(true) statements. [2023-12-16 16:13:18,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:13:18 BoogieIcfgContainer [2023-12-16 16:13:18,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:13:18,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:13:18,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:13:18,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:13:18,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:13:16" (1/3) ... [2023-12-16 16:13:18,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1539dc0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:13:18, skipping insertion in model container [2023-12-16 16:13:18,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:13:16" (2/3) ... [2023-12-16 16:13:18,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1539dc0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:13:18, skipping insertion in model container [2023-12-16 16:13:18,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:13:18" (3/3) ... [2023-12-16 16:13:18,020 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2023-12-16 16:13:18,032 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:13:18,032 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:13:18,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:13:18,080 INFO L357 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, mHoare=true, 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;@5fd1dc29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:13:18,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:13:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 70 states have (on average 1.8857142857142857) internal successors, (132), 86 states have internal predecessors, (132), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 16:13:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:13:18,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:13:18,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:13:18,091 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:13:18,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:13:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash -27349109, now seen corresponding path program 1 times [2023-12-16 16:13:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:13:18,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765802258] [2023-12-16 16:13:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:13:18,105 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 [2023-12-16 16:13:18,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:13:18,106 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) [2023-12-16 16:13:18,109 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 [2023-12-16 16:13:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:13:18,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:13:18,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:13:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:13:18,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:13:18,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:13:18,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765802258] [2023-12-16 16:13:18,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765802258] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:13:18,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:13:18,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:13:18,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432907896] [2023-12-16 16:13:18,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:13:18,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:13:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:13:18,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:13:18,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:13:18,243 INFO L87 Difference]: Start difference. First operand has 89 states, 70 states have (on average 1.8857142857142857) internal successors, (132), 86 states have internal predecessors, (132), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:13:18,436 INFO L93 Difference]: Finished difference Result 176 states and 323 transitions. [2023-12-16 16:13:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:13:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-16 16:13:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:13:18,447 INFO L225 Difference]: With dead ends: 176 [2023-12-16 16:13:18,448 INFO L226 Difference]: Without dead ends: 82 [2023-12-16 16:13:18,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:13:18,455 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:13:18,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:13:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-16 16:13:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-16 16:13:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.353846153846154) internal successors, (88), 79 states have internal predecessors, (88), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:13:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2023-12-16 16:13:18,498 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 6 [2023-12-16 16:13:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:13:18,498 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2023-12-16 16:13:18,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2023-12-16 16:13:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 16:13:18,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:13:18,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:13:18,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 16:13:18,706 WARN L477 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 [2023-12-16 16:13:18,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:13:18,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:13:18,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1471689875, now seen corresponding path program 1 times [2023-12-16 16:13:18,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:13:18,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743846369] [2023-12-16 16:13:18,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:13:18,708 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 [2023-12-16 16:13:18,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:13:18,709 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) [2023-12-16 16:13:18,728 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 [2023-12-16 16:13:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:13:18,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:13:18,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:13:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:13:18,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:13:18,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:13:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743846369] [2023-12-16 16:13:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743846369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:13:18,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:13:18,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:13:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693317001] [2023-12-16 16:13:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:13:18,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:13:18,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:13:18,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:13:18,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:13:18,827 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:13:19,136 INFO L93 Difference]: Finished difference Result 163 states and 209 transitions. [2023-12-16 16:13:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:13:19,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 16:13:19,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:13:19,142 INFO L225 Difference]: With dead ends: 163 [2023-12-16 16:13:19,142 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 16:13:19,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:13:19,143 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:13:19,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:13:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 16:13:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2023-12-16 16:13:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 81 states have internal predecessors, (90), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:13:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2023-12-16 16:13:19,151 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 7 [2023-12-16 16:13:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:13:19,152 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2023-12-16 16:13:19,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2023-12-16 16:13:19,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 16:13:19,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:13:19,153 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:13:19,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:13:19,356 WARN L477 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 [2023-12-16 16:13:19,357 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:13:19,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:13:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash -884179562, now seen corresponding path program 1 times [2023-12-16 16:13:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:13:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401778974] [2023-12-16 16:13:19,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:13:19,358 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 [2023-12-16 16:13:19,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:13:19,359 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) [2023-12-16 16:13:19,360 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 [2023-12-16 16:13:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:13:19,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:13:19,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:13:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:13:19,487 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:13:19,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:13:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401778974] [2023-12-16 16:13:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401778974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:13:19,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:13:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:13:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948329932] [2023-12-16 16:13:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:13:19,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:13:19,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:13:19,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:13:19,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:13:19,491 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:13:20,742 INFO L93 Difference]: Finished difference Result 157 states and 202 transitions. [2023-12-16 16:13:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:13:20,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 16:13:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:13:20,743 INFO L225 Difference]: With dead ends: 157 [2023-12-16 16:13:20,743 INFO L226 Difference]: Without dead ends: 152 [2023-12-16 16:13:20,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:13:20,744 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 146 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:13:20,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 303 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 16:13:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-16 16:13:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 87. [2023-12-16 16:13:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.323943661971831) internal successors, (94), 84 states have internal predecessors, (94), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:13:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2023-12-16 16:13:20,759 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 13 [2023-12-16 16:13:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:13:20,759 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2023-12-16 16:13:20,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2023-12-16 16:13:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 16:13:20,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:13:20,760 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:13:20,767 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 [2023-12-16 16:13:20,964 WARN L477 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 [2023-12-16 16:13:20,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:13:20,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:13:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1873104053, now seen corresponding path program 1 times [2023-12-16 16:13:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:13:20,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433228682] [2023-12-16 16:13:20,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:13:20,966 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 [2023-12-16 16:13:20,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:13:20,967 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) [2023-12-16 16:13:20,968 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 [2023-12-16 16:13:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:13:21,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 16:13:21,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:13:21,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-16 16:13:21,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-16 16:13:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:13:21,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:13:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:13:21,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:13:21,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433228682] [2023-12-16 16:13:21,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433228682] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:13:21,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:13:21,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2023-12-16 16:13:21,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861991746] [2023-12-16 16:13:21,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:13:21,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:13:21,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:13:21,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:13:21,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:13:21,422 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:13:24,149 INFO L93 Difference]: Finished difference Result 220 states and 283 transitions. [2023-12-16 16:13:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:13:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-16 16:13:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:13:24,151 INFO L225 Difference]: With dead ends: 220 [2023-12-16 16:13:24,152 INFO L226 Difference]: Without dead ends: 148 [2023-12-16 16:13:24,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:13:24,153 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 90 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:13:24,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 491 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 16:13:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-16 16:13:24,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2023-12-16 16:13:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 95 states have internal predecessors, (106), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:13:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2023-12-16 16:13:24,168 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 20 [2023-12-16 16:13:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:13:24,169 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2023-12-16 16:13:24,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2023-12-16 16:13:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 16:13:24,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:13:24,169 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:13:24,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:13:24,379 WARN L477 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 [2023-12-16 16:13:24,379 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:13:24,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:13:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1547688063, now seen corresponding path program 1 times [2023-12-16 16:13:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:13:24,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956708527] [2023-12-16 16:13:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:13:24,380 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 [2023-12-16 16:13:24,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:13:24,381 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) [2023-12-16 16:13:24,382 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 [2023-12-16 16:13:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:13:24,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 16:13:24,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:13:24,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-16 16:13:24,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-16 16:13:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:13:24,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:13:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:13:24,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:13:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956708527] [2023-12-16 16:13:24,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956708527] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:13:24,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:13:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2023-12-16 16:13:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882109991] [2023-12-16 16:13:24,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:13:24,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:13:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:13:24,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:13:24,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:13:24,910 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:13:27,075 INFO L93 Difference]: Finished difference Result 150 states and 190 transitions. [2023-12-16 16:13:27,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:13:27,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-16 16:13:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:13:27,076 INFO L225 Difference]: With dead ends: 150 [2023-12-16 16:13:27,076 INFO L226 Difference]: Without dead ends: 147 [2023-12-16 16:13:27,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:13:27,077 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 125 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:13:27,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 493 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 16:13:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-16 16:13:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 102. [2023-12-16 16:13:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 99 states have internal predecessors, (110), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:13:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2023-12-16 16:13:27,088 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 20 [2023-12-16 16:13:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:13:27,089 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2023-12-16 16:13:27,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2023-12-16 16:13:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:13:27,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:13:27,089 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:13:27,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:13:27,296 WARN L477 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 [2023-12-16 16:13:27,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:13:27,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:13:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -821516206, now seen corresponding path program 1 times [2023-12-16 16:13:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:13:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358103389] [2023-12-16 16:13:27,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:13:27,297 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 [2023-12-16 16:13:27,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:13:27,298 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) [2023-12-16 16:13:27,299 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 [2023-12-16 16:13:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:13:27,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:13:27,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:13:27,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-12-16 16:13:27,471 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 16 treesize of output 8 [2023-12-16 16:13:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:13:27,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:13:27,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:13:27,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358103389] [2023-12-16 16:13:27,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358103389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:13:27,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:13:27,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:13:27,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686384897] [2023-12-16 16:13:27,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:13:27,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:13:27,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:13:27,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:13:27,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:13:27,484 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:13:29,286 INFO L93 Difference]: Finished difference Result 165 states and 208 transitions. [2023-12-16 16:13:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:13:29,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-16 16:13:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:13:29,287 INFO L225 Difference]: With dead ends: 165 [2023-12-16 16:13:29,287 INFO L226 Difference]: Without dead ends: 162 [2023-12-16 16:13:29,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:13:29,288 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 131 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:13:29,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 299 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 16:13:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-16 16:13:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 108. [2023-12-16 16:13:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 105 states have internal predecessors, (117), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:13:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2023-12-16 16:13:29,298 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 23 [2023-12-16 16:13:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:13:29,298 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2023-12-16 16:13:29,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2023-12-16 16:13:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:13:29,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:13:29,299 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:13:29,306 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 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:13:29,502 WARN L477 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 [2023-12-16 16:13:29,505 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:13:29,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:13:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash -695432254, now seen corresponding path program 2 times [2023-12-16 16:13:29,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:13:29,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992772399] [2023-12-16 16:13:29,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:13:29,506 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 [2023-12-16 16:13:29,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:13:29,507 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) [2023-12-16 16:13:29,511 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 [2023-12-16 16:13:29,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 16:13:29,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:13:29,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:13:29,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:13:29,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-16 16:13:29,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 16:13:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:13:29,645 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:13:29,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:13:29,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992772399] [2023-12-16 16:13:29,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992772399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:13:29,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:13:29,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:13:29,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050192623] [2023-12-16 16:13:29,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:13:29,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:13:29,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:13:29,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:13:29,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:13:29,647 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:13:30,962 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2023-12-16 16:13:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:13:30,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-16 16:13:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:13:30,963 INFO L225 Difference]: With dead ends: 110 [2023-12-16 16:13:30,963 INFO L226 Difference]: Without dead ends: 107 [2023-12-16 16:13:30,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:13:30,964 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 12 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:13:30,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 292 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 16:13:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-16 16:13:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-16 16:13:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 104 states have internal predecessors, (116), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:13:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2023-12-16 16:13:30,976 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 26 [2023-12-16 16:13:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:13:30,976 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2023-12-16 16:13:30,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2023-12-16 16:13:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:13:30,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:13:30,977 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:13:30,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:13:31,179 WARN L477 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 [2023-12-16 16:13:31,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:13:31,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:13:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -370016264, now seen corresponding path program 2 times [2023-12-16 16:13:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:13:31,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093986533] [2023-12-16 16:13:31,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:13:31,181 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 [2023-12-16 16:13:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:13:31,182 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) [2023-12-16 16:13:31,183 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 [2023-12-16 16:13:31,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 16:13:31,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:13:31,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:13:31,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:13:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:13:31,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:13:31,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:13:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093986533] [2023-12-16 16:13:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093986533] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:13:31,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:13:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:13:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335652165] [2023-12-16 16:13:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:13:31,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:13:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:13:31,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:13:31,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:13:31,304 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:32,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:13:32,284 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2023-12-16 16:13:32,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:13:32,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-16 16:13:32,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:13:32,285 INFO L225 Difference]: With dead ends: 109 [2023-12-16 16:13:32,285 INFO L226 Difference]: Without dead ends: 106 [2023-12-16 16:13:32,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:13:32,286 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 12 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:13:32,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 286 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 16:13:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-16 16:13:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2023-12-16 16:13:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.25) internal successors, (110), 99 states have internal predecessors, (110), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:13:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2023-12-16 16:13:32,293 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 26 [2023-12-16 16:13:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:13:32,293 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2023-12-16 16:13:32,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:13:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2023-12-16 16:13:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:13:32,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:13:32,294 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:13:32,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:13:32,498 WARN L477 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 [2023-12-16 16:13:32,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:13:32,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:13:32,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1171618610, now seen corresponding path program 1 times [2023-12-16 16:13:32,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:13:32,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926811420] [2023-12-16 16:13:32,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:13:32,500 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 [2023-12-16 16:13:32,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:13:32,500 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) [2023-12-16 16:13:32,501 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 [2023-12-16 16:13:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:13:32,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 16:13:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:13:32,647 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 16:13:32,648 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 16:13:32,648 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:13:32,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:13:32,850 WARN L477 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 [2023-12-16 16:13:32,852 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2023-12-16 16:13:32,854 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:13:32,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:13:32 BoogieIcfgContainer [2023-12-16 16:13:32,875 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:13:32,876 INFO L158 Benchmark]: Toolchain (without parser) took 16210.89ms. Allocated memory was 200.3MB in the beginning and 329.3MB in the end (delta: 129.0MB). Free memory was 131.9MB in the beginning and 214.2MB in the end (delta: -82.3MB). Peak memory consumption was 47.8MB. Max. memory is 8.0GB. [2023-12-16 16:13:32,876 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 200.3MB. Free memory was 149.1MB in the beginning and 149.0MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:13:32,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.11ms. Allocated memory was 200.3MB in the beginning and 273.7MB in the end (delta: 73.4MB). Free memory was 131.7MB in the beginning and 234.7MB in the end (delta: -103.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 16:13:32,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.13ms. Allocated memory is still 273.7MB. Free memory was 234.7MB in the beginning and 232.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:13:32,876 INFO L158 Benchmark]: Boogie Preprocessor took 80.24ms. Allocated memory is still 273.7MB. Free memory was 232.0MB in the beginning and 226.3MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 16:13:32,877 INFO L158 Benchmark]: RCFGBuilder took 892.90ms. Allocated memory is still 273.7MB. Free memory was 226.3MB in the beginning and 193.8MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-12-16 16:13:32,877 INFO L158 Benchmark]: TraceAbstraction took 14863.87ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 193.2MB in the beginning and 214.2MB in the end (delta: -21.0MB). Peak memory consumption was 35.1MB. Max. memory is 8.0GB. [2023-12-16 16:13:32,880 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.38ms. Allocated memory is still 200.3MB. Free memory was 149.1MB in the beginning and 149.0MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.11ms. Allocated memory was 200.3MB in the beginning and 273.7MB in the end (delta: 73.4MB). Free memory was 131.7MB in the beginning and 234.7MB in the end (delta: -103.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.13ms. Allocated memory is still 273.7MB. Free memory was 234.7MB in the beginning and 232.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.24ms. Allocated memory is still 273.7MB. Free memory was 232.0MB in the beginning and 226.3MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 892.90ms. Allocated memory is still 273.7MB. Free memory was 226.3MB in the beginning and 193.8MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 14863.87ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 193.2MB in the beginning and 214.2MB in the end (delta: -21.0MB). Peak memory consumption was 35.1MB. Max. memory is 8.0GB. * 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 - CounterExampleResult [Line: 565]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE, EXPR !(!node) VAL [data={0:0}, node={6:0}] [L643] EXPR node->next = node [L644] EXPR node->value = __VERIFIER_nondet_int() [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE, EXPR !(!item) VAL [data={0:0}, item={3:0}, node={6:0}] [L648] EXPR item->slist = node [L649] EXPR item->next = data [L650] EXPR data = item [L639-L651] { struct node *node = malloc(sizeof *node); if (!node) abort(); node->next = node; node->value = __VERIFIER_nondet_int(); struct list *item = malloc(sizeof *item); if (!item) abort(); item->slist = node; item->next = data; data = item; } VAL [data={3:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L654] CALL inspect_before(data) [L615] COND FALSE !(!(shape)) VAL [shape={3:0}, shape={3:0}] [L616] shape->next [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={3:0}, shape={3:0}] [L623] EXPR shape->next [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist [L625] EXPR shape->slist->next [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 522 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 520 mSDsluCounter, 2465 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1772 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 967 IncrementalHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 693 mSDtfsCounter, 967 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=6, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 222 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 167 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1353 SizeOfPredicates, 33 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 24/32 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 proved your program to be incorrect! [2023-12-16 16:13:32,898 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...