/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/hardness-nfm22/hardness_variablewrapping_normal_file-31.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 11:45:19,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 11:45:19,807 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-24 11:45:19,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 11:45:19,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 11:45:19,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 11:45:19,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 11:45:19,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 11:45:19,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 11:45:19,843 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 11:45:19,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 11:45:19,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 11:45:19,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 11:45:19,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 11:45:19,844 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 11:45:19,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 11:45:19,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 11:45:19,845 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 11:45:19,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 11:45:19,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 11:45:19,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 11:45:19,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 11:45:19,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 11:45:19,849 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 11:45:19,849 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 11:45:19,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 11:45:19,849 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 11:45:19,850 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 11:45:19,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 11:45:19,850 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 11:45:19,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 11:45:19,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 11:45:19,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 11:45:19,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 11:45:19,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 11:45:19,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 11:45:19,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 11:45:19,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 11:45:19,852 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 11:45:19,852 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 11:45:19,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 11:45:19,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 11:45:19,852 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 11:45:19,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 11:45:19,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 11:45:19,853 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 11:45:19,853 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-24 11:45:20,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 11:45:20,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 11:45:20,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 11:45:20,036 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 11:45:20,036 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 11:45:20,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2023-12-24 11:45:21,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 11:45:21,221 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 11:45:21,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2023-12-24 11:45:21,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca1cbd179/c378d7db62484572967fd7f295ee5062/FLAG017faeacf [2023-12-24 11:45:21,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca1cbd179/c378d7db62484572967fd7f295ee5062 [2023-12-24 11:45:21,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 11:45:21,246 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 11:45:21,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 11:45:21,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 11:45:21,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 11:45:21,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f38417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21, skipping insertion in model container [2023-12-24 11:45:21,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,276 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 11:45:21,403 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-31.i[913,926] [2023-12-24 11:45:21,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 11:45:21,467 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 11:45:21,477 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-31.i[913,926] [2023-12-24 11:45:21,501 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 11:45:21,514 INFO L206 MainTranslator]: Completed translation [2023-12-24 11:45:21,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21 WrapperNode [2023-12-24 11:45:21,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 11:45:21,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 11:45:21,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 11:45:21,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 11:45:21,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,557 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2023-12-24 11:45:21,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 11:45:21,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 11:45:21,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 11:45:21,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 11:45:21,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,575 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 11:45:21,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 11:45:21,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 11:45:21,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 11:45:21,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 11:45:21,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (1/1) ... [2023-12-24 11:45:21,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 11:45:21,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 11:45:21,629 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-24 11:45:21,633 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-24 11:45:21,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 11:45:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 11:45:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 11:45:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 11:45:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 11:45:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 11:45:21,715 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 11:45:21,717 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 11:45:21,906 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 11:45:21,960 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 11:45:21,960 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 11:45:21,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:45:21 BoogieIcfgContainer [2023-12-24 11:45:21,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 11:45:21,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 11:45:21,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 11:45:21,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 11:45:21,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 11:45:21" (1/3) ... [2023-12-24 11:45:21,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1111e8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:45:21, skipping insertion in model container [2023-12-24 11:45:21,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:45:21" (2/3) ... [2023-12-24 11:45:21,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1111e8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:45:21, skipping insertion in model container [2023-12-24 11:45:21,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:45:21" (3/3) ... [2023-12-24 11:45:21,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-31.i [2023-12-24 11:45:21,981 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 11:45:21,981 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 11:45:22,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 11:45:22,019 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;@15e68f35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 11:45:22,020 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 11:45:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 11:45:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-24 11:45:22,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 11:45:22,030 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:45:22,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 11:45:22,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 11:45:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash 30954485, now seen corresponding path program 1 times [2023-12-24 11:45:22,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 11:45:22,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485410663] [2023-12-24 11:45:22,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 11:45:22,046 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-24 11:45:22,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 11:45:22,048 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-24 11:45:22,049 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-24 11:45:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 11:45:22,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 11:45:22,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 11:45:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 11:45:22,199 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 11:45:22,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 11:45:22,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485410663] [2023-12-24 11:45:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485410663] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 11:45:22,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 11:45:22,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 11:45:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457235731] [2023-12-24 11:45:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 11:45:22,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 11:45:22,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 11:45:22,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 11:45:22,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 11:45:22,238 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 11:45:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 11:45:22,296 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2023-12-24 11:45:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 11:45:22,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2023-12-24 11:45:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 11:45:22,307 INFO L225 Difference]: With dead ends: 74 [2023-12-24 11:45:22,307 INFO L226 Difference]: Without dead ends: 36 [2023-12-24 11:45:22,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 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-24 11:45:22,313 INFO L413 NwaCegarLoop]: 49 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, 49 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-24 11:45:22,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 11:45:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-24 11:45:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-24 11:45:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 11:45:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2023-12-24 11:45:22,341 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 70 [2023-12-24 11:45:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 11:45:22,342 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2023-12-24 11:45:22,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 11:45:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2023-12-24 11:45:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-24 11:45:22,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 11:45:22,344 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:45:22,351 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-24 11:45:22,551 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-24 11:45:22,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 11:45:22,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 11:45:22,553 INFO L85 PathProgramCache]: Analyzing trace with hash 88212787, now seen corresponding path program 1 times [2023-12-24 11:45:22,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 11:45:22,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597844012] [2023-12-24 11:45:22,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 11:45:22,555 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-24 11:45:22,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 11:45:22,557 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-24 11:45:22,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 11:45:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 11:45:22,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 11:45:22,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 11:46:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-24 11:46:39,333 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 11:46:39,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 11:46:39,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597844012] [2023-12-24 11:46:39,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597844012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 11:46:39,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 11:46:39,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 11:46:39,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587091997] [2023-12-24 11:46:39,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 11:46:39,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 11:46:39,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 11:46:39,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 11:46:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-24 11:46:39,336 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 11:46:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 11:46:40,541 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2023-12-24 11:46:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 11:46:40,543 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2023-12-24 11:46:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 11:46:40,544 INFO L225 Difference]: With dead ends: 104 [2023-12-24 11:46:40,544 INFO L226 Difference]: Without dead ends: 102 [2023-12-24 11:46:40,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2023-12-24 11:46:40,545 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 119 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 11:46:40,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 224 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 11:46:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-24 11:46:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2023-12-24 11:46:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-24 11:46:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2023-12-24 11:46:40,558 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 70 [2023-12-24 11:46:40,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 11:46:40,559 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2023-12-24 11:46:40,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 11:46:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2023-12-24 11:46:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-24 11:46:40,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 11:46:40,564 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:46:40,571 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-24 11:46:40,764 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-24 11:46:40,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 11:46:40,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 11:46:40,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1560204614, now seen corresponding path program 1 times [2023-12-24 11:46:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 11:46:40,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854155868] [2023-12-24 11:46:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 11:46:40,766 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-24 11:46:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 11:46:40,767 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-24 11:46:40,771 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-24 11:46:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 11:46:40,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 11:46:40,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 11:46:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-24 11:46:40,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 11:46:40,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 11:46:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854155868] [2023-12-24 11:46:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854155868] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 11:46:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [397185796] [2023-12-24 11:46:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 11:46:40,940 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 11:46:40,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 11:46:40,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 11:46:41,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-24 11:46:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 11:46:41,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 11:46:41,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 11:46:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-24 11:46:41,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 11:46:41,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [397185796] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 11:46:41,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 11:46:41,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-12-24 11:46:41,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934669720] [2023-12-24 11:46:41,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 11:46:41,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 11:46:41,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 11:46:41,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 11:46:41,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 11:46:41,400 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-24 11:46:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 11:46:41,594 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2023-12-24 11:46:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 11:46:41,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2023-12-24 11:46:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 11:46:41,598 INFO L225 Difference]: With dead ends: 115 [2023-12-24 11:46:41,598 INFO L226 Difference]: Without dead ends: 80 [2023-12-24 11:46:41,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-24 11:46:41,599 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 11:46:41,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 62 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 11:46:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-24 11:46:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2023-12-24 11:46:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-24 11:46:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2023-12-24 11:46:41,608 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 71 [2023-12-24 11:46:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 11:46:41,609 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2023-12-24 11:46:41,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-24 11:46:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2023-12-24 11:46:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-24 11:46:41,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 11:46:41,610 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:46:41,617 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-24 11:46:41,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-12-24 11:46:42,014 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 11:46:42,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 11:46:42,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 11:46:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1560145032, now seen corresponding path program 1 times [2023-12-24 11:46:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 11:46:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314511803] [2023-12-24 11:46:42,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 11:46:42,021 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-24 11:46:42,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 11:46:42,022 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-24 11:46:42,023 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-24 11:46:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 11:46:42,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 11:46:42,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 11:49:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-24 11:49:19,324 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 11:49:19,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 11:49:19,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314511803] [2023-12-24 11:49:19,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314511803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 11:49:19,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 11:49:19,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-24 11:49:19,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674764771] [2023-12-24 11:49:19,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 11:49:19,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 11:49:19,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 11:49:19,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 11:49:19,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-24 11:49:19,326 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 11:49:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 11:49:20,617 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2023-12-24 11:49:20,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 11:49:20,619 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2023-12-24 11:49:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 11:49:20,624 INFO L225 Difference]: With dead ends: 110 [2023-12-24 11:49:20,624 INFO L226 Difference]: Without dead ends: 108 [2023-12-24 11:49:20,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-12-24 11:49:20,627 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 90 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 11:49:20,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 244 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 11:49:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-24 11:49:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 77. [2023-12-24 11:49:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-24 11:49:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2023-12-24 11:49:20,653 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 71 [2023-12-24 11:49:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 11:49:20,654 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2023-12-24 11:49:20,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 11:49:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2023-12-24 11:49:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-24 11:49:20,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 11:49:20,655 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:49:20,662 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-24 11:49:20,858 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-24 11:49:20,858 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 11:49:20,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 11:49:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1969473372, now seen corresponding path program 1 times [2023-12-24 11:49:20,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 11:49:20,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560149711] [2023-12-24 11:49:20,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 11:49:20,859 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-24 11:49:20,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 11:49:20,860 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-24 11:49:20,861 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-24 11:49:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 11:49:20,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 11:49:20,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 11:49:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-24 11:49:41,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 11:54:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-24 11:54:20,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 11:54:20,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560149711] [2023-12-24 11:54:20,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560149711] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 11:54:20,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 11:54:20,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 25 [2023-12-24 11:54:20,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357633940] [2023-12-24 11:54:20,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 11:54:20,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 11:54:20,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 11:54:20,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 11:54:20,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2023-12-24 11:54:20,382 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 11:54:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 11:54:40,076 INFO L93 Difference]: Finished difference Result 166 states and 204 transitions. [2023-12-24 11:54:40,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 11:54:40,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2023-12-24 11:54:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 11:54:40,083 INFO L225 Difference]: With dead ends: 166 [2023-12-24 11:54:40,083 INFO L226 Difference]: Without dead ends: 164 [2023-12-24 11:54:40,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=309, Invalid=1097, Unknown=0, NotChecked=0, Total=1406 [2023-12-24 11:54:40,085 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 189 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2023-12-24 11:54:40,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 202 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2023-12-24 11:54:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-24 11:54:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2023-12-24 11:54:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 89 states have internal predecessors, (104), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 11:54:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2023-12-24 11:54:40,100 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 172 transitions. Word has length 71 [2023-12-24 11:54:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 11:54:40,100 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 172 transitions. [2023-12-24 11:54:40,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 11:54:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 172 transitions. [2023-12-24 11:54:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-24 11:54:40,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 11:54:40,101 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:54:40,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-24 11:54:40,302 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-24 11:54:40,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 11:54:40,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 11:54:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -108358864, now seen corresponding path program 1 times [2023-12-24 11:54:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 11:54:40,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221883529] [2023-12-24 11:54:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 11:54:40,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 11:54:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 11:54:40,305 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-24 11:54:40,310 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-24 11:54:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 11:54:40,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 11:54:40,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 11:55:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-24 11:55:31,781 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 11:55:31,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 11:55:31,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221883529] [2023-12-24 11:55:31,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221883529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 11:55:31,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 11:55:31,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 11:55:31,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416647013] [2023-12-24 11:55:31,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 11:55:31,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 11:55:31,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 11:55:31,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 11:55:31,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-24 11:55:31,784 INFO L87 Difference]: Start difference. First operand 132 states and 172 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 11:55:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 11:55:34,708 INFO L93 Difference]: Finished difference Result 178 states and 227 transitions. [2023-12-24 11:55:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 11:55:34,709 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2023-12-24 11:55:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 11:55:34,711 INFO L225 Difference]: With dead ends: 178 [2023-12-24 11:55:34,711 INFO L226 Difference]: Without dead ends: 176 [2023-12-24 11:55:34,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2023-12-24 11:55:34,712 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 102 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 11:55:34,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 233 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 11:55:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-24 11:55:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 136. [2023-12-24 11:55:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 93 states have internal predecessors, (110), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 11:55:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2023-12-24 11:55:34,733 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 71 [2023-12-24 11:55:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 11:55:34,733 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2023-12-24 11:55:34,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 11:55:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2023-12-24 11:55:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 11:55:34,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 11:55:34,735 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:55:34,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 11:55:34,937 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-24 11:55:34,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 11:55:34,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 11:55:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash -923906521, now seen corresponding path program 1 times [2023-12-24 11:55:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 11:55:34,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555824332] [2023-12-24 11:55:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 11:55:34,939 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-24 11:55:34,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 11:55:34,940 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-24 11:55:34,943 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-24 11:55:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 11:55:35,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 11:55:35,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 11:58:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-24 11:58:13,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-24 11:59:57,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 11:59:57,467 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 11:59:57,468 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-24 11:59:57,487 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 11:59:57,659 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-24 11:59:57,659 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 73 with TraceHistMax 11,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-3-2-2-2-3-2-1 context. [2023-12-24 11:59:57,663 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-24 11:59:57,665 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 11:59:57,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 11:59:57 BoogieIcfgContainer [2023-12-24 11:59:57,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 11:59:57,668 INFO L158 Benchmark]: Toolchain (without parser) took 876422.18ms. Allocated memory was 226.5MB in the beginning and 1.1GB in the end (delta: 859.8MB). Free memory was 164.3MB in the beginning and 579.6MB in the end (delta: -415.3MB). Peak memory consumption was 635.9MB. Max. memory is 8.0GB. [2023-12-24 11:59:57,668 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 176.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 11:59:57,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.97ms. Allocated memory is still 226.5MB. Free memory was 164.1MB in the beginning and 151.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 11:59:57,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.08ms. Allocated memory is still 226.5MB. Free memory was 151.2MB in the beginning and 149.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 11:59:57,669 INFO L158 Benchmark]: Boogie Preprocessor took 36.85ms. Allocated memory is still 226.5MB. Free memory was 149.2MB in the beginning and 146.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 11:59:57,669 INFO L158 Benchmark]: RCFGBuilder took 365.59ms. Allocated memory was 226.5MB in the beginning and 284.2MB in the end (delta: 57.7MB). Free memory was 146.6MB in the beginning and 234.1MB in the end (delta: -87.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-24 11:59:57,669 INFO L158 Benchmark]: TraceAbstraction took 875705.56ms. Allocated memory was 284.2MB in the beginning and 1.1GB in the end (delta: 802.2MB). Free memory was 233.6MB in the beginning and 579.6MB in the end (delta: -346.1MB). Peak memory consumption was 645.4MB. Max. memory is 8.0GB. [2023-12-24 11:59:57,671 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.14ms. Allocated memory is still 226.5MB. Free memory is still 176.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.97ms. Allocated memory is still 226.5MB. Free memory was 164.1MB in the beginning and 151.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.08ms. Allocated memory is still 226.5MB. Free memory was 151.2MB in the beginning and 149.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.85ms. Allocated memory is still 226.5MB. Free memory was 149.2MB in the beginning and 146.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 365.59ms. Allocated memory was 226.5MB in the beginning and 284.2MB in the end (delta: 57.7MB). Free memory was 146.6MB in the beginning and 234.1MB in the end (delta: -87.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 875705.56ms. Allocated memory was 284.2MB in the beginning and 1.1GB in the end (delta: 802.2MB). Free memory was 233.6MB in the beginning and 579.6MB in the end (delta: -346.1MB). Peak memory consumption was 645.4MB. 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 73 with TraceHistMax 11,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-37-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-3-2-2-2-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 875.7s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 525 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 523 mSDsluCounter, 1014 SdHoareTripleChecker+Invalid, 13.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 789 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1189 IncrementalHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 225 mSDtfsCounter, 1189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=6, InterpolantAutomatonStates: 78, 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, 6 MinimizatonAttempts, 141 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 585.0s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 558 ConstructedInterpolants, 10 QuantifiedInterpolants, 5043 SizeOfPredicates, 86 NumberOfNonLiveVariables, 879 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 1691/1760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown