/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-21.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 13:50:55,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 13:50:55,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 13:50:55,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 13:50:55,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 13:50:55,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 13:50:55,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 13:50:55,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 13:50:55,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 13:50:55,213 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 13:50:55,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 13:50:55,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 13:50:55,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 13:50:55,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 13:50:55,215 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 13:50:55,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 13:50:55,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 13:50:55,216 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 13:50:55,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 13:50:55,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 13:50:55,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 13:50:55,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 13:50:55,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 13:50:55,217 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 13:50:55,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 13:50:55,218 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 13:50:55,218 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 13:50:55,218 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 13:50:55,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 13:50:55,218 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 13:50:55,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 13:50:55,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 13:50:55,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 13:50:55,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 13:50:55,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 13:50:55,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 13:50:55,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 13:50:55,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 13:50:55,220 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 13:50:55,220 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 13:50:55,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 13:50:55,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 13:50:55,221 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 13:50:55,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 13:50:55,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 13:50:55,221 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 13:50:55,221 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 13:50:55,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 13:50:55,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 13:50:55,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 13:50:55,419 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 13:50:55,421 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 13:50:55,422 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-21.i [2023-12-16 13:50:56,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 13:50:56,960 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 13:50:56,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i [2023-12-16 13:50:56,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c48ee5e/d54668a1d11249b2ae899459ef6ed730/FLAG2d2ee0188 [2023-12-16 13:50:56,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c48ee5e/d54668a1d11249b2ae899459ef6ed730 [2023-12-16 13:50:56,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 13:50:56,978 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 13:50:56,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 13:50:56,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 13:50:56,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 13:50:56,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:50:56" (1/1) ... [2023-12-16 13:50:56,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449e1cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:56, skipping insertion in model container [2023-12-16 13:50:56,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:50:56" (1/1) ... [2023-12-16 13:50:56,999 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 13:50:57,088 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-21.i[915,928] [2023-12-16 13:50:57,113 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 13:50:57,123 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 13:50:57,131 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-21.i[915,928] [2023-12-16 13:50:57,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 13:50:57,158 INFO L206 MainTranslator]: Completed translation [2023-12-16 13:50:57,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57 WrapperNode [2023-12-16 13:50:57,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 13:50:57,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 13:50:57,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 13:50:57,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 13:50:57,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,186 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2023-12-16 13:50:57,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 13:50:57,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 13:50:57,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 13:50:57,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 13:50:57,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,209 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-16 13:50:57,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 13:50:57,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 13:50:57,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 13:50:57,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 13:50:57,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (1/1) ... [2023-12-16 13:50:57,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 13:50:57,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 13:50:57,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 13:50:57,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 13:50:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 13:50:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 13:50:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 13:50:57,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 13:50:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 13:50:57,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 13:50:57,340 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 13:50:57,341 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 13:50:57,513 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 13:50:57,546 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 13:50:57,547 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 13:50:57,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:50:57 BoogieIcfgContainer [2023-12-16 13:50:57,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 13:50:57,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 13:50:57,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 13:50:57,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 13:50:57,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:50:56" (1/3) ... [2023-12-16 13:50:57,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fee427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:50:57, skipping insertion in model container [2023-12-16 13:50:57,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:50:57" (2/3) ... [2023-12-16 13:50:57,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fee427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:50:57, skipping insertion in model container [2023-12-16 13:50:57,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:50:57" (3/3) ... [2023-12-16 13:50:57,552 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-21.i [2023-12-16 13:50:57,588 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 13:50:57,588 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 13:50:57,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 13:50:57,627 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;@6897b4d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 13:50:57,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 13:50:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 13:50:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 13:50:57,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 13:50:57,639 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-16 13:50:57,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 13:50:57,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 13:50:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1810277985, now seen corresponding path program 1 times [2023-12-16 13:50:57,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 13:50:57,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480592197] [2023-12-16 13:50:57,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 13:50:57,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-16 13:50:57,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 13:50:57,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 13:50:57,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 13:50:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 13:50:57,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 13:50:57,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 13:50:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 13:50:57,905 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 13:50:57,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 13:50:57,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480592197] [2023-12-16 13:50:57,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480592197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 13:50:57,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 13:50:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 13:50:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991030534] [2023-12-16 13:50:57,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 13:50:57,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 13:50:57,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 13:50:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 13:50:57,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 13:50:57,929 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 13:50:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 13:50:58,142 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2023-12-16 13:50:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 13:50:58,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-16 13:50:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 13:50:58,149 INFO L225 Difference]: With dead ends: 115 [2023-12-16 13:50:58,149 INFO L226 Difference]: Without dead ends: 75 [2023-12-16 13:50:58,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 13:50:58,154 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 51 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 13:50:58,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 145 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 13:50:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-16 13:50:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2023-12-16 13:50:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 13:50:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2023-12-16 13:50:58,213 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 60 [2023-12-16 13:50:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 13:50:58,213 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2023-12-16 13:50:58,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 13:50:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2023-12-16 13:50:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 13:50:58,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 13:50:58,216 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-16 13:50:58,225 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-16 13:50:58,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 13:50:58,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 13:50:58,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 13:50:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1812125027, now seen corresponding path program 1 times [2023-12-16 13:50:58,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 13:50:58,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321363831] [2023-12-16 13:50:58,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 13:50:58,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 13:50:58,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 13:50:58,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 13:50:58,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 13:50:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 13:50:58,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 13:50:58,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 13:51:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 13:51:31,153 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 13:51:31,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 13:51:31,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321363831] [2023-12-16 13:51:31,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321363831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 13:51:31,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 13:51:31,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 13:51:31,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030840950] [2023-12-16 13:51:31,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 13:51:31,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 13:51:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 13:51:31,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 13:51:31,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 13:51:31,155 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 13:51:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 13:51:31,444 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2023-12-16 13:51:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 13:51:31,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-16 13:51:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 13:51:31,446 INFO L225 Difference]: With dead ends: 114 [2023-12-16 13:51:31,446 INFO L226 Difference]: Without dead ends: 112 [2023-12-16 13:51:31,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 13:51:31,447 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 45 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 13:51:31,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 172 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 13:51:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-16 13:51:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2023-12-16 13:51:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-16 13:51:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2023-12-16 13:51:31,460 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 60 [2023-12-16 13:51:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 13:51:31,460 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2023-12-16 13:51:31,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 13:51:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2023-12-16 13:51:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 13:51:31,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 13:51:31,462 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-16 13:51:31,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 13:51:31,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 13:51:31,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 13:51:31,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 13:51:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1413417425, now seen corresponding path program 1 times [2023-12-16 13:51:31,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 13:51:31,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971359556] [2023-12-16 13:51:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 13:51:31,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 13:51:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 13:51:31,679 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 13:51:31,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 13:51:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 13:51:31,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 13:51:31,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 13:52:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 13:52:05,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 13:52:05,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 13:52:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971359556] [2023-12-16 13:52:05,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971359556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 13:52:05,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 13:52:05,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 13:52:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416867780] [2023-12-16 13:52:05,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 13:52:05,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 13:52:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 13:52:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 13:52:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 13:52:05,204 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 13:52:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 13:52:06,039 INFO L93 Difference]: Finished difference Result 113 states and 154 transitions. [2023-12-16 13:52:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 13:52:06,039 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), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2023-12-16 13:52:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 13:52:06,040 INFO L225 Difference]: With dead ends: 113 [2023-12-16 13:52:06,040 INFO L226 Difference]: Without dead ends: 111 [2023-12-16 13:52:06,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-16 13:52:06,041 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 60 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 13:52:06,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 170 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 13:52:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-16 13:52:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2023-12-16 13:52:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-16 13:52:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2023-12-16 13:52:06,059 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 61 [2023-12-16 13:52:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 13:52:06,065 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2023-12-16 13:52:06,065 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), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 13:52:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2023-12-16 13:52:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 13:52:06,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 13:52:06,069 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-16 13:52:06,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 13:52:06,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 13:52:06,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 13:52:06,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 13:52:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash 332200332, now seen corresponding path program 1 times [2023-12-16 13:52:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 13:52:06,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034437711] [2023-12-16 13:52:06,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 13:52:06,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 13:52:06,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 13:52:06,282 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 13:52:06,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 13:52:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 13:52:06,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 13:52:06,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-12-16 13:52:13,086 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 13:52:13,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 13:52:13,107 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 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 13:52:13,116 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-16 13:52:13,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 13:52:13,293 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 62 with TraceHistMax 9,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-10-2-2-2-2-2-2-2-2-2-3-2-2-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 ∧-31-2-2-3-2-2-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 context. [2023-12-16 13:52:13,297 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-16 13:52:13,298 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 13:52:13,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:52:13 BoogieIcfgContainer [2023-12-16 13:52:13,300 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 13:52:13,301 INFO L158 Benchmark]: Toolchain (without parser) took 76322.48ms. Allocated memory was 327.2MB in the beginning and 993.0MB in the end (delta: 665.8MB). Free memory was 270.3MB in the beginning and 718.5MB in the end (delta: -448.1MB). Peak memory consumption was 575.1MB. Max. memory is 8.0GB. [2023-12-16 13:52:13,301 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 13:52:13,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.79ms. Allocated memory is still 327.2MB. Free memory was 270.0MB in the beginning and 256.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 13:52:13,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.19ms. Allocated memory is still 327.2MB. Free memory was 256.7MB in the beginning and 254.9MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 13:52:13,302 INFO L158 Benchmark]: Boogie Preprocessor took 49.27ms. Allocated memory is still 327.2MB. Free memory was 254.9MB in the beginning and 252.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 13:52:13,302 INFO L158 Benchmark]: RCFGBuilder took 310.39ms. Allocated memory is still 327.2MB. Free memory was 252.2MB in the beginning and 233.9MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 13:52:13,302 INFO L158 Benchmark]: TraceAbstraction took 75751.76ms. Allocated memory was 327.2MB in the beginning and 993.0MB in the end (delta: 665.8MB). Free memory was 233.3MB in the beginning and 718.5MB in the end (delta: -485.1MB). Peak memory consumption was 538.4MB. Max. memory is 8.0GB. [2023-12-16 13:52:13,303 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.10ms. Allocated memory is still 188.7MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.79ms. Allocated memory is still 327.2MB. Free memory was 270.0MB in the beginning and 256.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.19ms. Allocated memory is still 327.2MB. Free memory was 256.7MB in the beginning and 254.9MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.27ms. Allocated memory is still 327.2MB. Free memory was 254.9MB in the beginning and 252.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 310.39ms. Allocated memory is still 327.2MB. Free memory was 252.2MB in the beginning and 233.9MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 75751.76ms. Allocated memory was 327.2MB in the beginning and 993.0MB in the end (delta: 665.8MB). Free memory was 233.3MB in the beginning and 718.5MB in the end (delta: -485.1MB). Peak memory consumption was 538.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 62 with TraceHistMax 9,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-10-2-2-2-2-2-2-2-2-2-3-2-2-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 ∧-31-2-2-3-2-2-2-3-2-2-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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.7s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 487 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 125 mSDtfsCounter, 310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 38 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 66.2s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1491 SizeOfPredicates, 34 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 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