/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_codestructure_steplocals_file-59.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 22:10:28,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 22:10:28,897 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-22 22:10:28,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 22:10:28,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 22:10:28,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 22:10:28,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 22:10:28,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 22:10:28,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 22:10:28,928 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 22:10:28,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 22:10:28,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 22:10:28,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 22:10:28,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 22:10:28,930 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 22:10:28,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 22:10:28,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 22:10:28,931 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 22:10:28,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 22:10:28,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 22:10:28,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 22:10:28,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 22:10:28,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 22:10:28,932 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 22:10:28,932 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 22:10:28,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 22:10:28,932 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 22:10:28,932 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 22:10:28,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 22:10:28,932 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 22:10:28,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 22:10:28,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 22:10:28,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 22:10:28,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 22:10:28,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 22:10:28,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 22:10:28,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 22:10:28,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 22:10:28,934 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 22:10:28,934 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 22:10:28,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 22:10:28,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 22:10:28,934 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 22:10:28,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 22:10:28,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 22:10:28,935 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 22:10:28,935 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-22 22:10:29,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 22:10:29,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 22:10:29,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 22:10:29,145 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 22:10:29,145 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 22:10:29,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_steplocals_file-59.i [2023-12-22 22:10:30,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 22:10:30,236 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 22:10:30,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_steplocals_file-59.i [2023-12-22 22:10:30,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a75bc1e/ef204663443c480a82ae7c93b061b989/FLAGa524eb311 [2023-12-22 22:10:30,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a75bc1e/ef204663443c480a82ae7c93b061b989 [2023-12-22 22:10:30,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 22:10:30,262 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 22:10:30,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 22:10:30,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 22:10:30,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 22:10:30,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39150761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30, skipping insertion in model container [2023-12-22 22:10:30,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,301 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 22:10:30,426 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_codestructure_steplocals_file-59.i[917,930] [2023-12-22 22:10:30,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 22:10:30,480 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 22:10:30,488 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_codestructure_steplocals_file-59.i[917,930] [2023-12-22 22:10:30,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 22:10:30,515 INFO L206 MainTranslator]: Completed translation [2023-12-22 22:10:30,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30 WrapperNode [2023-12-22 22:10:30,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 22:10:30,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 22:10:30,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 22:10:30,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 22:10:30,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,552 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2023-12-22 22:10:30,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 22:10:30,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 22:10:30,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 22:10:30,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 22:10:30,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,579 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-22 22:10:30,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 22:10:30,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 22:10:30,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 22:10:30,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 22:10:30,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (1/1) ... [2023-12-22 22:10:30,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 22:10:30,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 22:10:30,637 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-22 22:10:30,646 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-22 22:10:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 22:10:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 22:10:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-22 22:10:30,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-22 22:10:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 22:10:30,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 22:10:30,738 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 22:10:30,741 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 22:10:31,919 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 22:10:31,987 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 22:10:31,988 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-22 22:10:31,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:10:31 BoogieIcfgContainer [2023-12-22 22:10:31,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 22:10:31,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 22:10:31,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 22:10:31,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 22:10:31,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 10:10:30" (1/3) ... [2023-12-22 22:10:31,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afd3281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:10:31, skipping insertion in model container [2023-12-22 22:10:31,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:10:30" (2/3) ... [2023-12-22 22:10:31,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afd3281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:10:31, skipping insertion in model container [2023-12-22 22:10:31,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:10:31" (3/3) ... [2023-12-22 22:10:31,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-59.i [2023-12-22 22:10:32,006 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 22:10:32,007 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-22 22:10:32,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 22:10:32,041 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;@27322717, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 22:10:32,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-22 22:10:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-22 22:10:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-22 22:10:32,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 22:10:32,068 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:10:32,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 22:10:32,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 22:10:32,073 INFO L85 PathProgramCache]: Analyzing trace with hash 669873194, now seen corresponding path program 1 times [2023-12-22 22:10:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 22:10:32,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763498411] [2023-12-22 22:10:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 22:10:32,088 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-22 22:10:32,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 22:10:32,090 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-22 22:10:32,096 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-22 22:10:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 22:10:32,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 22:10:32,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 22:10:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2023-12-22 22:10:32,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 22:10:32,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 22:10:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763498411] [2023-12-22 22:10:32,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763498411] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 22:10:32,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 22:10:32,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 22:10:32,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020355268] [2023-12-22 22:10:32,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 22:10:32,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 22:10:32,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 22:10:32,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 22:10:32,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 22:10:32,415 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-22 22:10:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 22:10:32,873 INFO L93 Difference]: Finished difference Result 111 states and 196 transitions. [2023-12-22 22:10:32,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 22:10:32,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2023-12-22 22:10:32,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 22:10:32,896 INFO L225 Difference]: With dead ends: 111 [2023-12-22 22:10:32,896 INFO L226 Difference]: Without dead ends: 55 [2023-12-22 22:10:32,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-22 22:10:32,901 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 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.4s IncrementalHoareTripleChecker+Time [2023-12-22 22:10:32,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 22:10:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-22 22:10:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-22 22:10:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-22 22:10:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 84 transitions. [2023-12-22 22:10:32,928 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 84 transitions. Word has length 124 [2023-12-22 22:10:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 22:10:32,928 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 84 transitions. [2023-12-22 22:10:32,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-22 22:10:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 84 transitions. [2023-12-22 22:10:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-22 22:10:32,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 22:10:32,930 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:10:32,942 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-22 22:10:33,137 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-22 22:10:33,138 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 22:10:33,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 22:10:33,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2031864594, now seen corresponding path program 1 times [2023-12-22 22:10:33,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 22:10:33,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331478863] [2023-12-22 22:10:33,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 22:10:33,139 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-22 22:10:33,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 22:10:33,140 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-22 22:10:33,145 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-22 22:10:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 22:10:33,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 22:10:33,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 22:10:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-22 22:10:33,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 22:10:33,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 22:10:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331478863] [2023-12-22 22:10:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331478863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 22:10:33,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 22:10:33,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 22:10:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674054294] [2023-12-22 22:10:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 22:10:33,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 22:10:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 22:10:33,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 22:10:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 22:10:33,436 INFO L87 Difference]: Start difference. First operand 55 states and 84 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-22 22:10:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 22:10:34,565 INFO L93 Difference]: Finished difference Result 132 states and 198 transitions. [2023-12-22 22:10:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 22:10:34,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-12-22 22:10:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 22:10:34,571 INFO L225 Difference]: With dead ends: 132 [2023-12-22 22:10:34,571 INFO L226 Difference]: Without dead ends: 78 [2023-12-22 22:10:34,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 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-22 22:10:34,572 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 44 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-22 22:10:34,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 233 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-22 22:10:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-22 22:10:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-12-22 22:10:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-22 22:10:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2023-12-22 22:10:34,582 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 124 [2023-12-22 22:10:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 22:10:34,583 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2023-12-22 22:10:34,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-22 22:10:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2023-12-22 22:10:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-22 22:10:34,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 22:10:34,584 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:10:34,594 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-22 22:10:34,792 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-22 22:10:34,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 22:10:34,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 22:10:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash -268072052, now seen corresponding path program 1 times [2023-12-22 22:10:34,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 22:10:34,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506404287] [2023-12-22 22:10:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 22:10:34,794 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-22 22:10:34,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 22:10:34,795 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-22 22:10:34,796 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-22 22:10:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 22:10:34,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 22:10:34,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 22:10:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2023-12-22 22:10:35,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 22:10:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-22 22:10:35,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 22:10:35,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506404287] [2023-12-22 22:10:35,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506404287] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 22:10:35,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 22:10:35,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2023-12-22 22:10:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099757294] [2023-12-22 22:10:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 22:10:35,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 22:10:35,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 22:10:35,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 22:10:35,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-22 22:10:35,374 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-22 22:10:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 22:10:36,041 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2023-12-22 22:10:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 22:10:36,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-12-22 22:10:36,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 22:10:36,045 INFO L225 Difference]: With dead ends: 165 [2023-12-22 22:10:36,045 INFO L226 Difference]: Without dead ends: 91 [2023-12-22 22:10:36,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-22 22:10:36,047 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 31 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-22 22:10:36,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 206 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-22 22:10:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-22 22:10:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2023-12-22 22:10:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 56 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-22 22:10:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2023-12-22 22:10:36,058 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 125 [2023-12-22 22:10:36,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 22:10:36,059 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2023-12-22 22:10:36,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-22 22:10:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2023-12-22 22:10:36,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-22 22:10:36,061 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 22:10:36,061 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:10:36,083 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-22 22:10:36,264 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-22 22:10:36,265 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 22:10:36,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 22:10:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -108481781, now seen corresponding path program 1 times [2023-12-22 22:10:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 22:10:36,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167951812] [2023-12-22 22:10:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 22:10:36,266 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-22 22:10:36,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 22:10:36,267 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-22 22:10:36,269 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-22 22:10:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 22:10:36,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-22 22:10:36,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 22:10:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2023-12-22 22:10:38,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 22:10:56,798 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse9 ((_ zero_extend 24) c_~var_1_3~0)) (.cse5 (bvadd .cse10 ((_ zero_extend 16) c_~var_1_7~0))) (.cse4 ((_ zero_extend 16) c_~var_1_1~0)) (.cse3 (bvsdiv ((_ zero_extend 16) c_~var_1_6~0) .cse10))) (let ((.cse1 (forall ((|ULTIMATE.start_step_~stepLocal_4~0#1| (_ BitVec 8))) (not (= (bvmul .cse4 .cse3) ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_4~0#1|))))) (.cse6 (bvsgt .cse9 .cse5))) (and (or (let ((.cse2 ((_ zero_extend 16) ((_ extract 15 0) .cse5)))) (let ((.cse0 (bvsgt .cse4 .cse2))) (and (or (not .cse0) .cse1) (or .cse0 (forall ((|ULTIMATE.start_step_~stepLocal_4~0#1| (_ BitVec 8))) (not (= (bvmul .cse2 .cse3) ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_4~0#1|)))))))) .cse6) (or (let ((.cse8 ((_ zero_extend 16) ((_ extract 15 0) .cse9)))) (let ((.cse7 (bvsgt .cse4 .cse8))) (and (or .cse7 (forall ((|ULTIMATE.start_step_~stepLocal_4~0#1| (_ BitVec 8))) (not (= (bvmul .cse8 .cse3) ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_4~0#1|))))) (or (not .cse7) .cse1)))) (not .cse6)))))) is different from true [2023-12-22 22:11:18,572 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse2 (bvadd .cse5 ((_ zero_extend 16) c_~var_1_7~0)))) (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) .cse2))) (.cse0 (bvsdiv ((_ zero_extend 16) c_~var_1_6~0) .cse5))) (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse1 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((|ULTIMATE.start_step_~stepLocal_4~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_4~0#1|) (bvmul .cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse1)))))) (not (bvsgt .cse1 .cse2))))) (or (forall ((|ULTIMATE.start_step_~stepLocal_4~0#1| (_ BitVec 8))) (not (= (bvmul .cse3 .cse0) ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_4~0#1|)))) (forall ((~var_1_3~0 (_ BitVec 8))) (bvsgt ((_ zero_extend 16) ((_ zero_extend 8) ~var_1_3~0)) .cse3))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 16) ((_ zero_extend 8) ~var_1_3~0)))) (or (bvsgt ((_ zero_extend 24) ~var_1_3~0) .cse2) (not (bvsgt .cse4 .cse3)) (forall ((|ULTIMATE.start_step_~stepLocal_4~0#1| (_ BitVec 8))) (not (= (bvmul .cse4 .cse0) ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_4~0#1|))))))))))) is different from false [2023-12-22 22:11:34,566 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse2 (bvadd .cse5 ((_ zero_extend 16) c_~var_1_7~0)))) (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) .cse2))) (.cse0 (bvsdiv ((_ zero_extend 16) c_~var_1_6~0) .cse5))) (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse1 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((|ULTIMATE.start_step_~stepLocal_4~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_4~0#1|) (bvmul .cse0 ((_ zero_extend 16) ((_ extract 15 0) .cse1)))))) (not (bvsgt .cse1 .cse2))))) (or (forall ((|ULTIMATE.start_step_~stepLocal_4~0#1| (_ BitVec 8))) (not (= (bvmul .cse3 .cse0) ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_4~0#1|)))) (forall ((~var_1_3~0 (_ BitVec 8))) (bvsgt ((_ zero_extend 16) ((_ zero_extend 8) ~var_1_3~0)) .cse3))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 16) ((_ zero_extend 8) ~var_1_3~0)))) (or (bvsgt ((_ zero_extend 24) ~var_1_3~0) .cse2) (not (bvsgt .cse4 .cse3)) (forall ((|ULTIMATE.start_step_~stepLocal_4~0#1| (_ BitVec 8))) (not (= (bvmul .cse4 .cse0) ((_ zero_extend 24) |ULTIMATE.start_step_~stepLocal_4~0#1|))))))))))) is different from true [2023-12-22 22:11:38,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 22:11:38,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167951812] [2023-12-22 22:11:38,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167951812] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-22 22:11:38,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [28593262] [2023-12-22 22:11:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 22:11:38,405 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-22 22:11:38,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-22 22:11:38,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-22 22:11:38,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-22 22:11:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 22:11:39,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-22 22:11:39,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 22:12:24,058 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-22 22:12:48,753 WARN L293 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)