/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/array-fpi/s2iff.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 20:57:53,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 20:57:53,460 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-21 20:57:53,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 20:57:53,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 20:57:53,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 20:57:53,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 20:57:53,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 20:57:53,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 20:57:53,479 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 20:57:53,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 20:57:53,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 20:57:53,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 20:57:53,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 20:57:53,481 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 20:57:53,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 20:57:53,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 20:57:53,481 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 20:57:53,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 20:57:53,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 20:57:53,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 20:57:53,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 20:57:53,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 20:57:53,483 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 20:57:53,483 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 20:57:53,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 20:57:53,483 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 20:57:53,483 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 20:57:53,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 20:57:53,484 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 20:57:53,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 20:57:53,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 20:57:53,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 20:57:53,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 20:57:53,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:57:53,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 20:57:53,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 20:57:53,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 20:57:53,485 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 20:57:53,486 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 20:57:53,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 20:57:53,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 20:57:53,488 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 20:57:53,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 20:57:53,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 20:57:53,489 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 20:57:53,489 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-21 20:57:53,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 20:57:53,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 20:57:53,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 20:57:53,698 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 20:57:53,698 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 20:57:53,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s2iff.c [2023-12-21 20:57:54,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 20:57:54,795 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 20:57:54,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s2iff.c [2023-12-21 20:57:54,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ddda789/18919af3476d4175af13781d2fb365de/FLAG95a13e185 [2023-12-21 20:57:54,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ddda789/18919af3476d4175af13781d2fb365de [2023-12-21 20:57:54,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 20:57:54,815 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 20:57:54,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 20:57:54,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 20:57:54,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 20:57:54,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:57:54" (1/1) ... [2023-12-21 20:57:54,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d626692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:54, skipping insertion in model container [2023-12-21 20:57:54,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:57:54" (1/1) ... [2023-12-21 20:57:54,846 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 20:57:54,971 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s2iff.c[588,601] [2023-12-21 20:57:54,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:57:55,008 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 20:57:55,017 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s2iff.c[588,601] [2023-12-21 20:57:55,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:57:55,034 INFO L206 MainTranslator]: Completed translation [2023-12-21 20:57:55,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55 WrapperNode [2023-12-21 20:57:55,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 20:57:55,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 20:57:55,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 20:57:55,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 20:57:55,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,067 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-12-21 20:57:55,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 20:57:55,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 20:57:55,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 20:57:55,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 20:57:55,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,087 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 8, 4, 6]. 40 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 4 writes are split as follows [0, 0, 1, 3]. [2023-12-21 20:57:55,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 20:57:55,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 20:57:55,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 20:57:55,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 20:57:55,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (1/1) ... [2023-12-21 20:57:55,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:57:55,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 20:57:55,135 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-21 20:57:55,156 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-21 20:57:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 20:57:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 20:57:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 20:57:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 20:57:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-21 20:57:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 20:57:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-21 20:57:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-21 20:57:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-21 20:57:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-21 20:57:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 20:57:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 20:57:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 20:57:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 20:57:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-21 20:57:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 20:57:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 20:57:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-21 20:57:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-21 20:57:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-21 20:57:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-21 20:57:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 20:57:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 20:57:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 20:57:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 20:57:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-21 20:57:55,251 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 20:57:55,252 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 20:57:55,435 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 20:57:55,454 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 20:57:55,454 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 20:57:55,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:57:55 BoogieIcfgContainer [2023-12-21 20:57:55,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 20:57:55,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 20:57:55,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 20:57:55,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 20:57:55,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:57:54" (1/3) ... [2023-12-21 20:57:55,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210dd193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:57:55, skipping insertion in model container [2023-12-21 20:57:55,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:57:55" (2/3) ... [2023-12-21 20:57:55,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210dd193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:57:55, skipping insertion in model container [2023-12-21 20:57:55,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:57:55" (3/3) ... [2023-12-21 20:57:55,459 INFO L112 eAbstractionObserver]: Analyzing ICFG s2iff.c [2023-12-21 20:57:55,472 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 20:57:55,472 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 20:57:55,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 20:57:55,506 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;@555a7a9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 20:57:55,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 20:57:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 20:57:55,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:57:55,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:57:55,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:57:55,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:57:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash -278767546, now seen corresponding path program 1 times [2023-12-21 20:57:55,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:57:55,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279944846] [2023-12-21 20:57:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:57:55,524 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-21 20:57:55,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:57:55,526 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-21 20:57:55,534 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-21 20:57:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:57:55,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 20:57:55,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:57:55,653 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-21 20:57:55,653 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:57:55,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:57:55,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279944846] [2023-12-21 20:57:55,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279944846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:57:55,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:57:55,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 20:57:55,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666342672] [2023-12-21 20:57:55,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:57:55,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 20:57:55,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:57:55,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 20:57:55,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:57:55,676 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:57:55,694 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2023-12-21 20:57:55,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 20:57:55,696 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 20:57:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:57:55,701 INFO L225 Difference]: With dead ends: 29 [2023-12-21 20:57:55,701 INFO L226 Difference]: Without dead ends: 13 [2023-12-21 20:57:55,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-21 20:57:55,705 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:57:55,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:57:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-21 20:57:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-21 20:57:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-12-21 20:57:55,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2023-12-21 20:57:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:57:55,724 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-12-21 20:57:55,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-12-21 20:57:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 20:57:55,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:57:55,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:57:55,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-21 20:57:55,928 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-21 20:57:55,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:57:55,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:57:55,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1088114172, now seen corresponding path program 1 times [2023-12-21 20:57:55,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:57:55,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261928524] [2023-12-21 20:57:55,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:57:55,931 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-21 20:57:55,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:57:55,934 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-21 20:57:55,938 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-21 20:57:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:57:55,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 20:57:55,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:57:56,123 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-21 20:57:56,123 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:57:56,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:57:56,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261928524] [2023-12-21 20:57:56,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261928524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:57:56,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:57:56,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 20:57:56,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140195132] [2023-12-21 20:57:56,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:57:56,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 20:57:56,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:57:56,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 20:57:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 20:57:56,126 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:57:56,326 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2023-12-21 20:57:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 20:57:56,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 20:57:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:57:56,332 INFO L225 Difference]: With dead ends: 25 [2023-12-21 20:57:56,332 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 20:57:56,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 20:57:56,333 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:57:56,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 20:57:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 20:57:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2023-12-21 20:57:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-21 20:57:56,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2023-12-21 20:57:56,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:57:56,337 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-21 20:57:56,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:56,337 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-21 20:57:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 20:57:56,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:57:56,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:57:56,344 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-21 20:57:56,539 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-21 20:57:56,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:57:56,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:57:56,541 INFO L85 PathProgramCache]: Analyzing trace with hash 54367998, now seen corresponding path program 1 times [2023-12-21 20:57:56,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:57:56,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120219742] [2023-12-21 20:57:56,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:57:56,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:57:56,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:57:56,542 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-21 20:57:56,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 20:57:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:57:56,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 20:57:56,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:57:56,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:57:56,754 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 19 [2023-12-21 20:57:56,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 20:57:57,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:57,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 37 [2023-12-21 20:57:57,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:57,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 49 [2023-12-21 20:57:57,126 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-21 20:57:57,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:57:57,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2023-12-21 20:57:57,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 98 treesize of output 94 [2023-12-21 20:57:57,714 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-21 20:57:57,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:57:57,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120219742] [2023-12-21 20:57:57,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120219742] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:57:57,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:57:57,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-21 20:57:57,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728426992] [2023-12-21 20:57:57,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:57:57,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 20:57:57,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:57:57,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 20:57:57,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-12-21 20:57:57,716 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:57:58,795 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-12-21 20:57:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 20:57:58,795 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-21 20:57:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:57:58,797 INFO L225 Difference]: With dead ends: 27 [2023-12-21 20:57:58,797 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 20:57:58,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2023-12-21 20:57:58,798 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 20:57:58,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 27 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 20:57:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 20:57:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-12-21 20:57:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-21 20:57:58,802 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2023-12-21 20:57:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:57:58,803 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-21 20:57:58,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-21 20:57:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 20:57:58,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:57:58,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:57:58,807 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-21 20:57:59,007 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-21 20:57:59,007 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:57:59,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:57:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash 111626300, now seen corresponding path program 1 times [2023-12-21 20:57:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:57:59,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676277223] [2023-12-21 20:57:59,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:57:59,008 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-21 20:57:59,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:57:59,009 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-21 20:57:59,011 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-21 20:57:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:57:59,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-21 20:57:59,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:57:59,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 20:57:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:57:59,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:57:59,170 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 14 treesize of output 12 [2023-12-21 20:57:59,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-12-21 20:57:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:57:59,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:57:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676277223] [2023-12-21 20:57:59,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676277223] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:57:59,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:57:59,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-21 20:57:59,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894372990] [2023-12-21 20:57:59,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:57:59,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 20:57:59,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:57:59,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 20:57:59,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 20:57:59,191 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:57:59,403 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2023-12-21 20:57:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 20:57:59,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-21 20:57:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:57:59,414 INFO L225 Difference]: With dead ends: 30 [2023-12-21 20:57:59,414 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 20:57:59,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-21 20:57:59,415 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:57:59,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 20:57:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 20:57:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2023-12-21 20:57:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-12-21 20:57:59,420 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2023-12-21 20:57:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:57:59,420 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-12-21 20:57:59,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-12-21 20:57:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 20:57:59,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:57:59,421 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:57:59,428 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-21 20:57:59,625 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-21 20:57:59,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:57:59,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:57:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash -230177790, now seen corresponding path program 2 times [2023-12-21 20:57:59,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:57:59,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318599461] [2023-12-21 20:57:59,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:57:59,627 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-21 20:57:59,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:57:59,628 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-21 20:57:59,629 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-21 20:57:59,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:57:59,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:57:59,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 20:57:59,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:57:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:57:59,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:58:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:58:00,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:58:00,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318599461] [2023-12-21 20:58:00,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318599461] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:58:00,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:58:00,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-21 20:58:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113206340] [2023-12-21 20:58:00,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:58:00,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 20:58:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:58:00,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 20:58:00,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-21 20:58:00,020 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:58:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:58:00,684 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2023-12-21 20:58:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 20:58:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 20:58:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:58:00,685 INFO L225 Difference]: With dead ends: 49 [2023-12-21 20:58:00,685 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 20:58:00,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-12-21 20:58:00,686 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 124 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 20:58:00,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 22 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 20:58:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 20:58:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2023-12-21 20:58:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:58:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-12-21 20:58:00,691 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 15 [2023-12-21 20:58:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:58:00,691 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-12-21 20:58:00,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:58:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-12-21 20:58:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 20:58:00,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:58:00,692 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:58:00,694 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-21 20:58:00,894 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-21 20:58:00,894 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:58:00,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:58:00,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2013377864, now seen corresponding path program 3 times [2023-12-21 20:58:00,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:58:00,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925477746] [2023-12-21 20:58:00,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:58:00,895 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-21 20:58:00,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:58:00,896 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-21 20:58:00,898 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-21 20:58:00,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 20:58:00,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:58:00,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 20:58:00,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:58:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:58:01,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:58:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:58:01,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:58:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925477746] [2023-12-21 20:58:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925477746] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:58:01,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:58:01,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-21 20:58:01,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182638327] [2023-12-21 20:58:01,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:58:01,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 20:58:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:58:01,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 20:58:01,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-21 20:58:01,185 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:58:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:58:01,503 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-12-21 20:58:01,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 20:58:01,511 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-21 20:58:01,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:58:01,512 INFO L225 Difference]: With dead ends: 42 [2023-12-21 20:58:01,512 INFO L226 Difference]: Without dead ends: 30 [2023-12-21 20:58:01,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-21 20:58:01,513 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:58:01,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 17 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 20:58:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-21 20:58:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-12-21 20:58:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:58:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-12-21 20:58:01,518 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2023-12-21 20:58:01,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:58:01,518 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-12-21 20:58:01,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:58:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-12-21 20:58:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 20:58:01,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:58:01,518 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:58:01,521 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-21 20:58:01,719 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-21 20:58:01,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:58:01,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:58:01,719 INFO L85 PathProgramCache]: Analyzing trace with hash -919717436, now seen corresponding path program 4 times [2023-12-21 20:58:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:58:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529639512] [2023-12-21 20:58:01,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:58:01,720 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-21 20:58:01,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:58:01,722 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-21 20:58:01,723 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-21 20:58:01,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:58:01,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-21 20:58:01,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 20:58:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 20:58:01,876 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 20:58:01,876 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 20:58:01,877 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 20:58:01,883 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-21 20:58:02,079 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-21 20:58:02,081 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-12-21 20:58:02,084 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 20:58:02,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:58:02 BoogieIcfgContainer [2023-12-21 20:58:02,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 20:58:02,099 INFO L158 Benchmark]: Toolchain (without parser) took 7284.28ms. Allocated memory is still 291.5MB. Free memory was 238.8MB in the beginning and 141.4MB in the end (delta: 97.4MB). Peak memory consumption was 98.5MB. Max. memory is 8.0GB. [2023-12-21 20:58:02,100 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 191.9MB. Free memory was 140.6MB in the beginning and 140.4MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 20:58:02,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.92ms. Allocated memory is still 291.5MB. Free memory was 238.8MB in the beginning and 226.8MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 20:58:02,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.70ms. Allocated memory is still 291.5MB. Free memory was 226.8MB in the beginning and 224.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 20:58:02,100 INFO L158 Benchmark]: Boogie Preprocessor took 30.22ms. Allocated memory is still 291.5MB. Free memory was 224.7MB in the beginning and 222.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 20:58:02,100 INFO L158 Benchmark]: RCFGBuilder took 356.18ms. Allocated memory is still 291.5MB. Free memory was 222.6MB in the beginning and 206.9MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 20:58:02,101 INFO L158 Benchmark]: TraceAbstraction took 6643.24ms. Allocated memory is still 291.5MB. Free memory was 206.4MB in the beginning and 141.4MB in the end (delta: 64.9MB). Peak memory consumption was 66.0MB. Max. memory is 8.0GB. [2023-12-21 20:58:02,102 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.15ms. Allocated memory is still 191.9MB. Free memory was 140.6MB in the beginning and 140.4MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.92ms. Allocated memory is still 291.5MB. Free memory was 238.8MB in the beginning and 226.8MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.70ms. Allocated memory is still 291.5MB. Free memory was 226.8MB in the beginning and 224.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.22ms. Allocated memory is still 291.5MB. Free memory was 224.7MB in the beginning and 222.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 356.18ms. Allocated memory is still 291.5MB. Free memory was 222.6MB in the beginning and 206.9MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 6643.24ms. Allocated memory is still 291.5MB. Free memory was 206.4MB in the beginning and 141.4MB in the end (delta: 64.9MB). Peak memory consumption was 66.0MB. 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [N=2, \old(cond)=1, cond=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] sum[0] = 1 [L32] i=0 VAL [N=2, a={7:0}, i=0, sum={15:0}] [L32] COND TRUE i