/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/ldv-regression/test23-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:01:19,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:01:19,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 21:01:19,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:01:19,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:01:19,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:01:19,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:01:19,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:01:19,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:01:19,248 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:01:19,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:01:19,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:01:19,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:01:19,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:01:19,251 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:01:19,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:01:19,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:01:19,252 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:01:19,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:01:19,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:01:19,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:01:19,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:01:19,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:01:19,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:01:19,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:01:19,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:01:19,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:01:19,255 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:01:19,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:01:19,256 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:01:19,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:01:19,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:01:19,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:01:19,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:01:19,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:01:19,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:01:19,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:01:19,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:01:19,258 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:01:19,258 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:01:19,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:01:19,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:01:19,259 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:01:19,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:01:19,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:01:19,260 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:01:19,260 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 21:01:19,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:01:19,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:01:19,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:01:19,542 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:01:19,543 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:01:19,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test23-1.c [2023-12-24 21:01:20,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:01:21,012 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:01:21,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-1.c [2023-12-24 21:01:21,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71ba8a695/da8837f7f69745daad127e73a8ea5db5/FLAG464dce6f3 [2023-12-24 21:01:21,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71ba8a695/da8837f7f69745daad127e73a8ea5db5 [2023-12-24 21:01:21,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:01:21,040 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:01:21,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:01:21,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:01:21,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:01:21,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@546732ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21, skipping insertion in model container [2023-12-24 21:01:21,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,070 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:01:21,233 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-1.c[1075,1088] [2023-12-24 21:01:21,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:01:21,247 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:01:21,278 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-1.c[1075,1088] [2023-12-24 21:01:21,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:01:21,298 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:01:21,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21 WrapperNode [2023-12-24 21:01:21,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:01:21,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:01:21,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:01:21,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:01:21,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,328 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2023-12-24 21:01:21,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:01:21,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:01:21,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:01:21,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:01:21,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,367 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2023-12-24 21:01:21,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:01:21,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:01:21,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:01:21,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:01:21,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (1/1) ... [2023-12-24 21:01:21,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:01:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:01:21,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 21:01:21,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 21:01:21,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:01:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:01:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:01:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:01:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:01:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2023-12-24 21:01:21,464 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2023-12-24 21:01:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:01:21,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:01:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:01:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:01:21,552 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:01:21,553 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:01:21,745 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:01:21,804 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:01:21,804 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 21:01:21,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:01:21 BoogieIcfgContainer [2023-12-24 21:01:21,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:01:21,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:01:21,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:01:21,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:01:21,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:01:21" (1/3) ... [2023-12-24 21:01:21,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb9fa2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:01:21, skipping insertion in model container [2023-12-24 21:01:21,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:01:21" (2/3) ... [2023-12-24 21:01:21,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb9fa2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:01:21, skipping insertion in model container [2023-12-24 21:01:21,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:01:21" (3/3) ... [2023-12-24 21:01:21,812 INFO L112 eAbstractionObserver]: Analyzing ICFG test23-1.c [2023-12-24 21:01:21,838 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:01:21,838 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:01:21,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:01:21,879 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;@50266054, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:01:21,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:01:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:01:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-24 21:01:21,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:01:21,890 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:01:21,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:01:21,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:01:21,895 INFO L85 PathProgramCache]: Analyzing trace with hash -35949440, now seen corresponding path program 1 times [2023-12-24 21:01:21,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:01:21,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440907962] [2023-12-24 21:01:21,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:01:21,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:21,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:01:21,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:01:21,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 21:01:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:01:22,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:01:22,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:01:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 21:01:22,058 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:01:22,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:01:22,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440907962] [2023-12-24 21:01:22,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440907962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:01:22,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:01:22,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:01:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008955993] [2023-12-24 21:01:22,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:01:22,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:01:22,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:01:22,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:01:22,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:01:22,093 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:01:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:01:22,135 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-12-24 21:01:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:01:22,138 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2023-12-24 21:01:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:01:22,145 INFO L225 Difference]: With dead ends: 24 [2023-12-24 21:01:22,145 INFO L226 Difference]: Without dead ends: 14 [2023-12-24 21:01:22,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:01:22,155 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:01:22,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:01:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-24 21:01:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-24 21:01:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:01:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-24 21:01:22,188 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 14 [2023-12-24 21:01:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:01:22,189 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-24 21:01:22,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:01:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-24 21:01:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-24 21:01:22,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:01:22,193 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:01:22,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 21:01:22,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:22,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:01:22,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:01:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1121744136, now seen corresponding path program 1 times [2023-12-24 21:01:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:01:22,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715378021] [2023-12-24 21:01:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:01:22,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:22,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:01:22,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:01:22,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 21:01:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:01:22,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 21:01:22,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:01:22,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 21:01:22,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-24 21:01:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 21:01:22,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:01:22,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:01:22,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715378021] [2023-12-24 21:01:22,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715378021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:01:22,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:01:22,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:01:22,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872830547] [2023-12-24 21:01:22,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:01:22,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:01:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:01:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:01:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:01:22,671 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:01:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:01:22,768 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2023-12-24 21:01:22,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:01:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2023-12-24 21:01:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:01:22,770 INFO L225 Difference]: With dead ends: 20 [2023-12-24 21:01:22,770 INFO L226 Difference]: Without dead ends: 16 [2023-12-24 21:01:22,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:01:22,772 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:01:22,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:01:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-24 21:01:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-24 21:01:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:01:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-12-24 21:01:22,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2023-12-24 21:01:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:01:22,792 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-12-24 21:01:22,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:01:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-12-24 21:01:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 21:01:22,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:01:22,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:01:22,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:01:22,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:22,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:01:22,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:01:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 68065171, now seen corresponding path program 1 times [2023-12-24 21:01:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:01:23,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210092374] [2023-12-24 21:01:23,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:01:23,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:23,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:01:23,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:01:23,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 21:01:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:01:23,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 21:01:23,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:01:23,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 21:01:23,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-24 21:01:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 21:01:23,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:01:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 21:01:23,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:01:23,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210092374] [2023-12-24 21:01:23,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210092374] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:01:23,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:01:23,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-24 21:01:23,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492226108] [2023-12-24 21:01:23,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:01:23,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:01:23,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:01:23,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:01:23,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:01:23,365 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:01:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:01:23,638 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-12-24 21:01:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 21:01:23,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-24 21:01:23,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:01:23,640 INFO L225 Difference]: With dead ends: 26 [2023-12-24 21:01:23,640 INFO L226 Difference]: Without dead ends: 22 [2023-12-24 21:01:23,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-24 21:01:23,641 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:01:23,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 52 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:01:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-24 21:01:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-24 21:01:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:01:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-12-24 21:01:23,646 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2023-12-24 21:01:23,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:01:23,646 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-12-24 21:01:23,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:01:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-12-24 21:01:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:01:23,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:01:23,647 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:01:23,654 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 (4)] Ended with exit code 0 [2023-12-24 21:01:23,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:23,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:01:23,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:01:23,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1001513756, now seen corresponding path program 2 times [2023-12-24 21:01:23,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:01:23,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659562882] [2023-12-24 21:01:23,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:01:23,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:23,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:01:23,853 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:01:23,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 21:01:23,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:01:23,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:01:23,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 21:01:23,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:01:24,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 21:01:24,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2023-12-24 21:01:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:01:24,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:01:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 21:01:25,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:01:25,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659562882] [2023-12-24 21:01:25,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659562882] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:01:25,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:01:25,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2023-12-24 21:01:25,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121175251] [2023-12-24 21:01:25,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:01:25,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-24 21:01:25,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:01:25,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-24 21:01:25,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-12-24 21:01:25,520 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:01:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:01:27,894 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2023-12-24 21:01:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 21:01:27,896 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2023-12-24 21:01:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:01:27,896 INFO L225 Difference]: With dead ends: 38 [2023-12-24 21:01:27,896 INFO L226 Difference]: Without dead ends: 34 [2023-12-24 21:01:27,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=452, Invalid=1440, Unknown=0, NotChecked=0, Total=1892 [2023-12-24 21:01:27,898 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 67 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 21:01:27,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 94 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 21:01:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-24 21:01:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-24 21:01:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:01:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-12-24 21:01:27,907 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 23 [2023-12-24 21:01:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:01:27,907 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-12-24 21:01:27,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:01:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-12-24 21:01:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 21:01:27,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:01:27,910 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:01:27,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 21:01:28,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:28,112 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:01:28,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:01:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1451472198, now seen corresponding path program 3 times [2023-12-24 21:01:28,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:01:28,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586391654] [2023-12-24 21:01:28,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 21:01:28,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:28,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:01:28,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:01:28,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 21:01:28,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-24 21:01:28,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:01:28,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 21:01:28,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:01:28,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 21:01:29,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2023-12-24 21:01:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:01:29,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:01:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 21:01:31,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:01:31,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586391654] [2023-12-24 21:01:31,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586391654] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:01:31,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:01:31,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2023-12-24 21:01:31,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384466420] [2023-12-24 21:01:31,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:01:31,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-24 21:01:31,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:01:31,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-24 21:01:31,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2023-12-24 21:01:31,069 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:01:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:01:38,648 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2023-12-24 21:01:38,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-24 21:01:38,650 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-12-24 21:01:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:01:38,651 INFO L225 Difference]: With dead ends: 66 [2023-12-24 21:01:38,651 INFO L226 Difference]: Without dead ends: 62 [2023-12-24 21:01:38,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1217, Invalid=4789, Unknown=0, NotChecked=0, Total=6006 [2023-12-24 21:01:38,654 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 172 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:01:38,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 127 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 21:01:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-24 21:01:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2023-12-24 21:01:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:01:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2023-12-24 21:01:38,668 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2023-12-24 21:01:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:01:38,668 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2023-12-24 21:01:38,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:01:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2023-12-24 21:01:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-24 21:01:38,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:01:38,669 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:01:38,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 21:01:38,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:38,870 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:01:38,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:01:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash -972200351, now seen corresponding path program 4 times [2023-12-24 21:01:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:01:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856440922] [2023-12-24 21:01:38,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 21:01:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:01:38,872 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:01:38,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 21:01:38,949 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 21:01:38,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-24 21:01:38,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-24 21:01:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 21:01:39,058 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-24 21:01:39,058 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-24 21:01:39,059 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:01:39,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 21:01:39,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:01:39,264 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2023-12-24 21:01:39,266 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:01:39,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:01:39 BoogieIcfgContainer [2023-12-24 21:01:39,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:01:39,310 INFO L158 Benchmark]: Toolchain (without parser) took 18269.35ms. Allocated memory is still 272.6MB. Free memory was 221.8MB in the beginning and 144.7MB in the end (delta: 77.1MB). Peak memory consumption was 78.2MB. Max. memory is 8.0GB. [2023-12-24 21:01:39,310 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 180.4MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:01:39,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.98ms. Allocated memory is still 272.6MB. Free memory was 221.3MB in the beginning and 209.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 21:01:39,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.33ms. Allocated memory is still 272.6MB. Free memory was 209.8MB in the beginning and 208.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:01:39,310 INFO L158 Benchmark]: Boogie Preprocessor took 60.52ms. Allocated memory is still 272.6MB. Free memory was 207.7MB in the beginning and 205.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:01:39,311 INFO L158 Benchmark]: RCFGBuilder took 414.06ms. Allocated memory is still 272.6MB. Free memory was 205.6MB in the beginning and 188.3MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 21:01:39,311 INFO L158 Benchmark]: TraceAbstraction took 17502.37ms. Allocated memory is still 272.6MB. Free memory was 187.8MB in the beginning and 144.7MB in the end (delta: 43.1MB). Peak memory consumption was 44.6MB. Max. memory is 8.0GB. [2023-12-24 21:01:39,312 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.74ms. Allocated memory is still 180.4MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.98ms. Allocated memory is still 272.6MB. Free memory was 221.3MB in the beginning and 209.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.33ms. Allocated memory is still 272.6MB. Free memory was 209.8MB in the beginning and 208.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.52ms. Allocated memory is still 272.6MB. Free memory was 207.7MB in the beginning and 205.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 414.06ms. Allocated memory is still 272.6MB. Free memory was 205.6MB in the beginning and 188.3MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 17502.37ms. Allocated memory is still 272.6MB. Free memory was 187.8MB in the beginning and 144.7MB in the end (delta: 43.1MB). Peak memory consumption was 44.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 52]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L35] CALL init() [L16] d1.a = __VERIFIER_nondet_int() [L17] d1.b = __VERIFIER_nondet_int() [L19] d2.a = __VERIFIER_nondet_int() [L20] d2.b = __VERIFIER_nondet_int() [L35] RET init() [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, pd1={5:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L37] int i = __VERIFIER_nondet_int(); [L38] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L39] pd2->array[i] = i [L40] int *pa = &pd1->array[i]; [L41] EXPR pd2->array[i] [L41] i = pd2->array[i] - 10 [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-9, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-8, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-7, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-6, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-5, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-4, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-3, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-2, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-1, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=0, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=1, pa={5:8}, pd1={5:0}, pd2={5:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND FALSE !(i <= *pa) [L45] CALL, EXPR check(pd2, i) [L30] EXPR s1->array[i] [L30] return s1->array[i] == i; [L45] RET, EXPR check(pd2, i) [L45] COND TRUE !check(pd2, i) [L52] reach_error() VAL [d1={4:0}, d2={5:0}, i=1, pa={5:8}, pd1={5:0}, pd2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 312 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 262 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 629 IncrementalHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 50 mSDtfsCounter, 629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=5, InterpolantAutomatonStates: 92, 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, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 171 ConstructedInterpolants, 30 QuantifiedInterpolants, 2133 SizeOfPredicates, 52 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 16/280 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 proved your program to be incorrect! [2023-12-24 21:01:39,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...