/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/loops/sum01_bug02.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:09:49,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:09:49,261 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 22:09:49,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:09:49,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:09:49,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:09:49,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:09:49,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:09:49,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:09:49,294 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:09:49,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:09:49,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:09:49,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:09:49,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:09:49,297 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:09:49,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:09:49,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:09:49,298 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:09:49,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:09:49,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:09:49,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:09:49,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:09:49,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:09:49,299 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:09:49,299 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:09:49,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:09:49,299 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:09:49,300 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:09:49,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:09:49,300 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:09:49,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:09:49,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:09:49,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:09:49,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:09:49,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:09:49,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:09:49,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:09:49,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:09:49,302 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:09:49,302 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:09:49,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:09:49,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:09:49,302 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:09:49,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:09:49,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:09:49,303 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:09:49,303 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 22:09:49,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:09:49,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:09:49,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:09:49,529 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:09:49,529 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:09:49,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02.i [2023-12-24 22:09:50,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:09:50,979 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:09:50,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2023-12-24 22:09:50,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2b5eaa0/be9a611eade540d8bb4803ba55d9bd86/FLAG28b528f2a [2023-12-24 22:09:50,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2b5eaa0/be9a611eade540d8bb4803ba55d9bd86 [2023-12-24 22:09:51,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:09:51,003 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:09:51,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:09:51,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:09:51,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:09:51,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27422313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51, skipping insertion in model container [2023-12-24 22:09:51,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,029 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:09:51,153 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i[812,825] [2023-12-24 22:09:51,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:09:51,182 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:09:51,193 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i[812,825] [2023-12-24 22:09:51,198 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:09:51,212 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:09:51,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51 WrapperNode [2023-12-24 22:09:51,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:09:51,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:09:51,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:09:51,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:09:51,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,247 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2023-12-24 22:09:51,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:09:51,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:09:51,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:09:51,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:09:51,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,279 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 22:09:51,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:09:51,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:09:51,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:09:51,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:09:51,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (1/1) ... [2023-12-24 22:09:51,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:09:51,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:09:51,325 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 22:09:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:09:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:09:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:09:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:09:51,355 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 22:09:51,415 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:09:51,416 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:09:51,555 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:09:51,585 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:09:51,585 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 22:09:51,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:09:51 BoogieIcfgContainer [2023-12-24 22:09:51,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:09:51,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:09:51,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:09:51,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:09:51,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:09:51" (1/3) ... [2023-12-24 22:09:51,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389668fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:09:51, skipping insertion in model container [2023-12-24 22:09:51,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:09:51" (2/3) ... [2023-12-24 22:09:51,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389668fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:09:51, skipping insertion in model container [2023-12-24 22:09:51,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:09:51" (3/3) ... [2023-12-24 22:09:51,594 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2023-12-24 22:09:51,608 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:09:51,609 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:09:51,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:09:51,658 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;@2b44e56e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:09:51,659 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:09:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 22:09:51,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:09:51,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 22:09:51,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:09:51,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:09:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2140513856, now seen corresponding path program 1 times [2023-12-24 22:09:51,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:09:51,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598207054] [2023-12-24 22:09:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:09:51,687 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 22:09:51,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:09:51,690 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 22:09:51,705 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 22:09:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:09:51,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 22:09:51,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:09:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:51,795 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:09:51,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:09:51,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598207054] [2023-12-24 22:09:51,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598207054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:09:51,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:09:51,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 22:09:51,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99920650] [2023-12-24 22:09:51,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:09:51,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 22:09:51,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:09:51,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 22:09:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 22:09:51,833 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:09:51,855 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2023-12-24 22:09:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 22:09:51,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-24 22:09:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:09:51,863 INFO L225 Difference]: With dead ends: 19 [2023-12-24 22:09:51,863 INFO L226 Difference]: Without dead ends: 9 [2023-12-24 22:09:51,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 22:09:51,868 INFO L413 NwaCegarLoop]: 11 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, 11 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 22:09:51,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:09:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-24 22:09:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-24 22:09:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-12-24 22:09:51,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2023-12-24 22:09:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:09:51,892 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-12-24 22:09:51,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-12-24 22:09:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 22:09:51,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:09:51,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 22:09:51,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 22:09:52,096 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 22:09:52,096 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:09:52,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:09:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2140901139, now seen corresponding path program 1 times [2023-12-24 22:09:52,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:09:52,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868284857] [2023-12-24 22:09:52,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:09:52,098 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 22:09:52,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:09:52,099 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 22:09:52,110 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 22:09:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:09:52,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 22:09:52,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:09:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:52,193 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:09:52,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:09:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868284857] [2023-12-24 22:09:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868284857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:09:52,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:09:52,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 22:09:52,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769843216] [2023-12-24 22:09:52,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:09:52,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 22:09:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:09:52,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 22:09:52,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:09:52,196 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:09:52,224 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-12-24 22:09:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 22:09:52,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-24 22:09:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:09:52,225 INFO L225 Difference]: With dead ends: 16 [2023-12-24 22:09:52,225 INFO L226 Difference]: Without dead ends: 12 [2023-12-24 22:09:52,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:09:52,226 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:09:52,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:09:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-24 22:09:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-24 22:09:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-12-24 22:09:52,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2023-12-24 22:09:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:09:52,231 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-12-24 22:09:52,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-12-24 22:09:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 22:09:52,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:09:52,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:09:52,235 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 22:09:52,436 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 22:09:52,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:09:52,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:09:52,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2117223459, now seen corresponding path program 1 times [2023-12-24 22:09:52,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:09:52,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758370970] [2023-12-24 22:09:52,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:09:52,438 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 22:09:52,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:09:52,442 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 22:09:52,443 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 22:09:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:09:52,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 22:09:52,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:09:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:52,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:09:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:53,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:09:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758370970] [2023-12-24 22:09:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758370970] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:09:53,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:09:53,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-24 22:09:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525118653] [2023-12-24 22:09:53,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:09:53,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 22:09:53,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:09:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 22:09:53,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-12-24 22:09:53,122 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:09:53,442 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-12-24 22:09:53,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 22:09:53,443 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 22:09:53,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:09:53,443 INFO L225 Difference]: With dead ends: 28 [2023-12-24 22:09:53,443 INFO L226 Difference]: Without dead ends: 22 [2023-12-24 22:09:53,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2023-12-24 22:09:53,445 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:09:53,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 19 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:09:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-24 22:09:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2023-12-24 22:09:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-24 22:09:53,450 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2023-12-24 22:09:53,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:09:53,450 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-24 22:09:53,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-24 22:09:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 22:09:53,451 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:09:53,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:09:53,453 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 22:09:53,651 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 22:09:53,652 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:09:53,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:09:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1052836821, now seen corresponding path program 1 times [2023-12-24 22:09:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:09:53,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288419517] [2023-12-24 22:09:53,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:09:53,653 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 22:09:53,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:09:53,656 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 22:09:53,657 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 22:09:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:09:53,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:09:53,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:09:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:53,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:09:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:53,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:09:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288419517] [2023-12-24 22:09:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288419517] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:09:53,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:09:53,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 22:09:53,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271024614] [2023-12-24 22:09:53,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:09:53,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 22:09:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:09:53,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 22:09:53,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-24 22:09:53,780 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:09:53,848 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-12-24 22:09:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 22:09:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-24 22:09:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:09:53,849 INFO L225 Difference]: With dead ends: 35 [2023-12-24 22:09:53,849 INFO L226 Difference]: Without dead ends: 25 [2023-12-24 22:09:53,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-24 22:09:53,850 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:09:53,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:09:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-24 22:09:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2023-12-24 22:09:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-12-24 22:09:53,854 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2023-12-24 22:09:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:09:53,854 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-12-24 22:09:53,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-12-24 22:09:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-24 22:09:53,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:09:53,855 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-12-24 22:09:53,860 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 22:09:54,057 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 22:09:54,058 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:09:54,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:09:54,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1903600093, now seen corresponding path program 2 times [2023-12-24 22:09:54,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:09:54,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73566797] [2023-12-24 22:09:54,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:09:54,059 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 22:09:54,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:09:54,062 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 22:09:54,065 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 22:09:54,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:09:54,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:09:54,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 22:09:54,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:09:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:54,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:09:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:55,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:09:55,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73566797] [2023-12-24 22:09:55,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73566797] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:09:55,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:09:55,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-24 22:09:55,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741725994] [2023-12-24 22:09:55,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:09:55,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-24 22:09:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:09:55,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-24 22:09:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2023-12-24 22:09:55,429 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:09:56,831 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-12-24 22:09:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-24 22:09:56,831 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-24 22:09:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:09:56,832 INFO L225 Difference]: With dead ends: 37 [2023-12-24 22:09:56,833 INFO L226 Difference]: Without dead ends: 31 [2023-12-24 22:09:56,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=312, Invalid=1328, Unknown=0, NotChecked=0, Total=1640 [2023-12-24 22:09:56,834 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 35 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 22:09:56,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 22:09:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-24 22:09:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-12-24 22:09:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-24 22:09:56,842 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2023-12-24 22:09:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:09:56,842 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-24 22:09:56,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-24 22:09:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 22:09:56,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:09:56,843 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:09:56,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 22:09:57,043 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 22:09:57,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:09:57,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:09:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash -540755685, now seen corresponding path program 2 times [2023-12-24 22:09:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:09:57,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118927452] [2023-12-24 22:09:57,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:09:57,045 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 22:09:57,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:09:57,046 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 22:09:57,047 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 22:09:57,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:09:57,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:09:57,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 22:09:57,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:09:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:57,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:09:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:09:57,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:09:57,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118927452] [2023-12-24 22:09:57,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118927452] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:09:57,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:09:57,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-12-24 22:09:57,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758269524] [2023-12-24 22:09:57,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:09:57,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 22:09:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:09:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 22:09:57,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-24 22:09:57,327 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:09:57,411 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-12-24 22:09:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 22:09:57,411 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-24 22:09:57,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:09:57,412 INFO L225 Difference]: With dead ends: 36 [2023-12-24 22:09:57,412 INFO L226 Difference]: Without dead ends: 29 [2023-12-24 22:09:57,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-24 22:09:57,413 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:09:57,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:09:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-24 22:09:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-12-24 22:09:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-12-24 22:09:57,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2023-12-24 22:09:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:09:57,417 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-12-24 22:09:57,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-12-24 22:09:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 22:09:57,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:09:57,417 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:09:57,423 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 22:09:57,620 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 22:09:57,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:09:57,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:09:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1646145579, now seen corresponding path program 3 times [2023-12-24 22:09:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:09:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906290766] [2023-12-24 22:09:57,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:09:57,621 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 22:09:57,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:09:57,622 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 22:09:57,622 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 22:09:57,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-12-24 22:09:57,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-24 22:09:57,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-24 22:09:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 22:09:57,680 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-24 22:09:57,680 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-24 22:09:57,681 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:09:57,686 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 22:09:57,882 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 22:09:57,885 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2023-12-24 22:09:57,888 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:09:57,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:09:57 BoogieIcfgContainer [2023-12-24 22:09:57,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:09:57,904 INFO L158 Benchmark]: Toolchain (without parser) took 6901.91ms. Allocated memory is still 283.1MB. Free memory was 227.7MB in the beginning and 101.3MB in the end (delta: 126.3MB). Peak memory consumption was 127.3MB. Max. memory is 8.0GB. [2023-12-24 22:09:57,905 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 215.0MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:09:57,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.88ms. Allocated memory is still 283.1MB. Free memory was 227.1MB in the beginning and 216.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 22:09:57,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.91ms. Allocated memory is still 283.1MB. Free memory was 216.1MB in the beginning and 214.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 22:09:57,905 INFO L158 Benchmark]: Boogie Preprocessor took 50.65ms. Allocated memory is still 283.1MB. Free memory was 214.6MB in the beginning and 213.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:09:57,905 INFO L158 Benchmark]: RCFGBuilder took 285.99ms. Allocated memory is still 283.1MB. Free memory was 213.0MB in the beginning and 202.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-24 22:09:57,906 INFO L158 Benchmark]: TraceAbstraction took 6316.20ms. Allocated memory is still 283.1MB. Free memory was 201.4MB in the beginning and 101.3MB in the end (delta: 100.1MB). Peak memory consumption was 101.1MB. Max. memory is 8.0GB. [2023-12-24 22:09:57,907 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.57ms. Allocated memory is still 215.0MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.88ms. Allocated memory is still 283.1MB. Free memory was 227.1MB in the beginning and 216.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.91ms. Allocated memory is still 283.1MB. Free memory was 216.1MB in the beginning and 214.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.65ms. Allocated memory is still 283.1MB. Free memory was 214.6MB in the beginning and 213.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 285.99ms. Allocated memory is still 283.1MB. Free memory was 213.0MB in the beginning and 202.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6316.20ms. Allocated memory is still 283.1MB. Free memory was 201.4MB in the beginning and 101.3MB in the end (delta: 100.1MB). Peak memory consumption was 101.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; VAL [j=10, n=0] [L24] COND FALSE !(n==2147483647) [L27] i=1 VAL [i=1, j=10, n=0, n=6] [L27] COND TRUE i<=n VAL [i=1, j=10, n=0, n=6] [L28] COND TRUE i