/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_loopvsstraightlinecode_25-1loop_file-24.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 00:05:25,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 00:05:26,000 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 00:05:26,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 00:05:26,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 00:05:26,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 00:05:26,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 00:05:26,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 00:05:26,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 00:05:26,098 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 00:05:26,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 00:05:26,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 00:05:26,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 00:05:26,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 00:05:26,101 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 00:05:26,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 00:05:26,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 00:05:26,103 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 00:05:26,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 00:05:26,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 00:05:26,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 00:05:26,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 00:05:26,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 00:05:26,105 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 00:05:26,105 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 00:05:26,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 00:05:26,106 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 00:05:26,106 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 00:05:26,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 00:05:26,108 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 00:05:26,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 00:05:26,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 00:05:26,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 00:05:26,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 00:05:26,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 00:05:26,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 00:05:26,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 00:05:26,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 00:05:26,112 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 00:05:26,112 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 00:05:26,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 00:05:26,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 00:05:26,129 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 00:05:26,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 00:05:26,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 00:05:26,130 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 00:05:26,131 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 00:05:26,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 00:05:26,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 00:05:26,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 00:05:26,651 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 00:05:26,654 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 00:05:26,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i [2023-12-24 00:05:27,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 00:05:28,114 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 00:05:28,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i [2023-12-24 00:05:28,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1343b130/d539f7ef9d9742c1b975719de692ee02/FLAGebbeab529 [2023-12-24 00:05:28,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1343b130/d539f7ef9d9742c1b975719de692ee02 [2023-12-24 00:05:28,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 00:05:28,147 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 00:05:28,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 00:05:28,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 00:05:28,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 00:05:28,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8a86c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28, skipping insertion in model container [2023-12-24 00:05:28,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,179 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 00:05:28,336 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_loopvsstraightlinecode_25-1loop_file-24.i[915,928] [2023-12-24 00:05:28,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 00:05:28,385 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 00:05:28,394 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_loopvsstraightlinecode_25-1loop_file-24.i[915,928] [2023-12-24 00:05:28,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 00:05:28,420 INFO L206 MainTranslator]: Completed translation [2023-12-24 00:05:28,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28 WrapperNode [2023-12-24 00:05:28,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 00:05:28,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 00:05:28,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 00:05:28,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 00:05:28,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,465 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2023-12-24 00:05:28,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 00:05:28,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 00:05:28,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 00:05:28,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 00:05:28,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,511 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 00:05:28,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 00:05:28,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 00:05:28,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 00:05:28,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 00:05:28,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (1/1) ... [2023-12-24 00:05:28,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 00:05:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 00:05:28,560 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 00:05:28,569 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 00:05:28,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 00:05:28,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 00:05:28,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 00:05:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 00:05:28,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 00:05:28,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 00:05:28,669 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 00:05:28,671 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 00:05:29,047 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 00:05:29,117 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 00:05:29,117 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 00:05:29,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:05:29 BoogieIcfgContainer [2023-12-24 00:05:29,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 00:05:29,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 00:05:29,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 00:05:29,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 00:05:29,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 12:05:28" (1/3) ... [2023-12-24 00:05:29,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6f3019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:05:29, skipping insertion in model container [2023-12-24 00:05:29,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:05:28" (2/3) ... [2023-12-24 00:05:29,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6f3019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:05:29, skipping insertion in model container [2023-12-24 00:05:29,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:05:29" (3/3) ... [2023-12-24 00:05:29,126 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-24.i [2023-12-24 00:05:29,169 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 00:05:29,170 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 00:05:29,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 00:05:29,218 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;@62b06745, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 00:05:29,218 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 00:05:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 00:05:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-24 00:05:29,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:05:29,230 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:05:29,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:05:29,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:05:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1158333792, now seen corresponding path program 1 times [2023-12-24 00:05:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:05:29,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118419293] [2023-12-24 00:05:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:05:29,249 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 00:05:29,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:05:29,252 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 00:05:29,259 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 00:05:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:05:29,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 00:05:29,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:05:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2023-12-24 00:05:29,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:05:29,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:05:29,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118419293] [2023-12-24 00:05:29,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118419293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:05:29,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:05:29,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 00:05:29,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327620283] [2023-12-24 00:05:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:05:29,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 00:05:29,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:05:29,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 00:05:29,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 00:05:29,521 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 00:05:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:05:29,616 INFO L93 Difference]: Finished difference Result 83 states and 142 transitions. [2023-12-24 00:05:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 00:05:29,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 92 [2023-12-24 00:05:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:05:29,624 INFO L225 Difference]: With dead ends: 83 [2023-12-24 00:05:29,624 INFO L226 Difference]: Without dead ends: 40 [2023-12-24 00:05:29,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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 00:05:29,633 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 00:05:29,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 00:05:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-24 00:05:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-24 00:05:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 00:05:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2023-12-24 00:05:29,671 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 92 [2023-12-24 00:05:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:05:29,671 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2023-12-24 00:05:29,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 00:05:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2023-12-24 00:05:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-24 00:05:29,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:05:29,675 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:05:29,688 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 00:05:29,884 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 00:05:29,885 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:05:29,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:05:29,886 INFO L85 PathProgramCache]: Analyzing trace with hash 669175970, now seen corresponding path program 1 times [2023-12-24 00:05:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:05:29,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748714662] [2023-12-24 00:05:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:05:29,887 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 00:05:29,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:05:29,889 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 00:05:29,892 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 00:05:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:05:30,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 00:05:30,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:12:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 00:12:02,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:12:02,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:12:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748714662] [2023-12-24 00:12:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748714662] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:12:02,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:12:02,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 00:12:02,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564876269] [2023-12-24 00:12:02,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:12:02,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 00:12:02,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:12:02,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 00:12:02,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 00:12:02,486 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 00:12:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:12:03,373 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2023-12-24 00:12:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 00:12:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 92 [2023-12-24 00:12:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:12:03,393 INFO L225 Difference]: With dead ends: 63 [2023-12-24 00:12:03,393 INFO L226 Difference]: Without dead ends: 61 [2023-12-24 00:12:03,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-24 00:12:03,395 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 28 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 00:12:03,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 145 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 00:12:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-24 00:12:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2023-12-24 00:12:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 00:12:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2023-12-24 00:12:03,403 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 92 [2023-12-24 00:12:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:12:03,425 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2023-12-24 00:12:03,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 00:12:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2023-12-24 00:12:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-24 00:12:03,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:12:03,448 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:03,473 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 00:12:03,672 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 00:12:03,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:12:03,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:12:03,675 INFO L85 PathProgramCache]: Analyzing trace with hash 671023012, now seen corresponding path program 1 times [2023-12-24 00:12:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:12:03,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750772893] [2023-12-24 00:12:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:12:03,675 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 00:12:03,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:12:03,677 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 00:12:03,694 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 00:12:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:12:03,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 00:12:03,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:15:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 00:15:46,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:15:46,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:15:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750772893] [2023-12-24 00:15:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750772893] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:15:46,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:15:46,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 00:15:46,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724511671] [2023-12-24 00:15:46,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:15:46,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 00:15:46,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:15:46,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 00:15:46,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 00:15:46,053 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 00:15:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:15:47,134 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2023-12-24 00:15:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 00:15:47,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 92 [2023-12-24 00:15:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:15:47,141 INFO L225 Difference]: With dead ends: 65 [2023-12-24 00:15:47,141 INFO L226 Difference]: Without dead ends: 63 [2023-12-24 00:15:47,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-24 00:15:47,144 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 25 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 00:15:47,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 176 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 00:15:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-24 00:15:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2023-12-24 00:15:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 00:15:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2023-12-24 00:15:47,157 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 92 [2023-12-24 00:15:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:15:47,157 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2023-12-24 00:15:47,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 00:15:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2023-12-24 00:15:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 00:15:47,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:15:47,158 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:15:47,166 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 00:15:47,371 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-24 00:15:47,371 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:15:47,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:15:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash -739797273, now seen corresponding path program 1 times [2023-12-24 00:15:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:15:47,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961613029] [2023-12-24 00:15:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:15:47,375 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 00:15:47,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:15:47,376 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-24 00:15:47,377 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-24 00:15:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:15:47,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 00:15:47,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:17:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 00:17:40,661 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:17:40,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:17:40,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961613029] [2023-12-24 00:17:40,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961613029] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:17:40,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:17:40,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 00:17:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78074776] [2023-12-24 00:17:40,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:17:40,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 00:17:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:17:40,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 00:17:40,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 00:17:40,668 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 00:17:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:17:43,886 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2023-12-24 00:17:43,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 00:17:43,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 93 [2023-12-24 00:17:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:17:43,891 INFO L225 Difference]: With dead ends: 67 [2023-12-24 00:17:43,891 INFO L226 Difference]: Without dead ends: 65 [2023-12-24 00:17:43,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-24 00:17:43,892 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 28 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-24 00:17:43,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 162 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-24 00:17:43,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-24 00:17:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2023-12-24 00:17:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 00:17:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2023-12-24 00:17:43,897 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 93 [2023-12-24 00:17:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:17:43,897 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2023-12-24 00:17:43,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 00:17:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2023-12-24 00:17:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 00:17:43,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:17:43,898 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:17:43,904 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-24 00:17:44,101 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-24 00:17:44,101 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:17:44,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:17:44,102 INFO L85 PathProgramCache]: Analyzing trace with hash -739856855, now seen corresponding path program 1 times [2023-12-24 00:17:44,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:17:44,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923656651] [2023-12-24 00:17:44,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:17:44,102 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 00:17:44,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:17:44,103 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 00:17:44,106 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 00:17:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:17:44,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 00:17:44,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:19:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 00:19:34,118 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:19:34,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:19:34,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923656651] [2023-12-24 00:19:34,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923656651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:19:34,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:19:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 00:19:34,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209234183] [2023-12-24 00:19:34,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:19:34,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 00:19:34,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:19:34,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 00:19:34,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 00:19:34,120 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 00:19:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:19:36,689 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2023-12-24 00:19:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 00:19:36,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 93 [2023-12-24 00:19:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:19:36,694 INFO L225 Difference]: With dead ends: 63 [2023-12-24 00:19:36,694 INFO L226 Difference]: Without dead ends: 61 [2023-12-24 00:19:36,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-24 00:19:36,695 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 00:19:36,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 138 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 00:19:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-24 00:19:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2023-12-24 00:19:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 00:19:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2023-12-24 00:19:36,700 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 93 [2023-12-24 00:19:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:19:36,701 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2023-12-24 00:19:36,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 00:19:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2023-12-24 00:19:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 00:19:36,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:19:36,702 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:19:36,716 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 00:19:36,914 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 00:19:36,914 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:19:36,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:19:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash -682538971, now seen corresponding path program 1 times [2023-12-24 00:19:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:19:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367144356] [2023-12-24 00:19:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:19:36,915 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 00:19:36,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:19:36,917 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 00:19:36,924 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 00:19:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:19:37,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 00:19:37,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-12-24 00:20:01,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 00:20:01,549 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 00:20:01,550 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 00:20:01,556 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-24 00:20:01,742 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 00:20:01,742 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 94 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-11-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-38-2-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. [2023-12-24 00:20:01,746 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-24 00:20:01,748 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 00:20:01,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 12:20:01 BoogieIcfgContainer [2023-12-24 00:20:01,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 00:20:01,754 INFO L158 Benchmark]: Toolchain (without parser) took 873607.08ms. Allocated memory was 302.0MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 221.8MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 907.2MB. Max. memory is 8.0GB. [2023-12-24 00:20:01,756 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 302.0MB. Free memory is still 268.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 00:20:01,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.77ms. Allocated memory is still 302.0MB. Free memory was 221.7MB in the beginning and 256.5MB in the end (delta: -34.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2023-12-24 00:20:01,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.27ms. Allocated memory is still 302.0MB. Free memory was 256.5MB in the beginning and 254.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 00:20:01,757 INFO L158 Benchmark]: Boogie Preprocessor took 56.70ms. Allocated memory is still 302.0MB. Free memory was 254.4MB in the beginning and 251.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 00:20:01,757 INFO L158 Benchmark]: RCFGBuilder took 594.16ms. Allocated memory is still 302.0MB. Free memory was 251.8MB in the beginning and 257.9MB in the end (delta: -6.2MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. [2023-12-24 00:20:01,757 INFO L158 Benchmark]: TraceAbstraction took 872633.79ms. Allocated memory was 302.0MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 257.4MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 941.4MB. Max. memory is 8.0GB. [2023-12-24 00:20:01,759 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 302.0MB. Free memory is still 268.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.77ms. Allocated memory is still 302.0MB. Free memory was 221.7MB in the beginning and 256.5MB in the end (delta: -34.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.27ms. Allocated memory is still 302.0MB. Free memory was 256.5MB in the beginning and 254.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.70ms. Allocated memory is still 302.0MB. Free memory was 254.4MB in the beginning and 251.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 594.16ms. Allocated memory is still 302.0MB. Free memory was 251.8MB in the beginning and 257.9MB in the end (delta: -6.2MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. * TraceAbstraction took 872633.79ms. Allocated memory was 302.0MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 257.4MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 941.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 94 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-11-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-38-2-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 872.5s, OverallIterations: 6, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 677 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 420 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 257 mSDtfsCounter, 329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 837.7s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 1422 SizeOfPredicates, 64 NumberOfNonLiveVariables, 774 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2100/2100 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