/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loops/invert_string-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:07:27,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:07:27,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 22:07:27,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:07:27,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:07:27,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:07:27,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:07:27,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:07:27,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:07:27,492 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:07:27,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:07:27,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:07:27,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:07:27,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:07:27,494 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:07:27,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:07:27,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:07:27,495 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:07:27,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:07:27,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:07:27,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:07:27,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:07:27,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:07:27,497 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:07:27,497 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:07:27,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:07:27,497 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:07:27,497 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:07:27,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:07:27,498 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:07:27,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:07:27,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:07:27,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:07:27,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:07:27,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:07:27,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:07:27,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:07:27,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:07:27,499 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:07:27,499 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:07:27,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:07:27,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:07:27,500 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:07:27,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:07:27,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:07:27,501 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:07:27,501 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 22:07:27,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:07:27,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:07:27,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:07:27,721 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:07:27,721 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:07:27,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-1.c [2023-12-24 22:07:28,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:07:28,944 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:07:28,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c [2023-12-24 22:07:28,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0520ffa/0d00ec51178447ddb1e009df4d6c074d/FLAG324e166f4 [2023-12-24 22:07:28,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0520ffa/0d00ec51178447ddb1e009df4d6c074d [2023-12-24 22:07:28,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:07:28,965 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:07:28,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:07:28,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:07:28,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:07:28,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:07:28" (1/1) ... [2023-12-24 22:07:28,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc2d979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:28, skipping insertion in model container [2023-12-24 22:07:28,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:07:28" (1/1) ... [2023-12-24 22:07:28,988 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:07:29,097 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c[352,365] [2023-12-24 22:07:29,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:07:29,120 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:07:29,128 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c[352,365] [2023-12-24 22:07:29,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:07:29,143 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:07:29,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29 WrapperNode [2023-12-24 22:07:29,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:07:29,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:07:29,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:07:29,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:07:29,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,166 INFO L138 Inliner]: procedures = 15, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-12-24 22:07:29,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:07:29,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:07:29,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:07:29,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:07:29,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,184 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 4, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2023-12-24 22:07:29,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:07:29,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:07:29,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:07:29,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:07:29,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (1/1) ... [2023-12-24 22:07:29,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:07:29,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:07:29,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 22:07:29,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 22:07:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:07:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 22:07:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 22:07:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 22:07:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:07:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 22:07:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 22:07:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 22:07:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:07:29,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:07:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 22:07:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 22:07:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 22:07:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 22:07:29,298 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:07:29,299 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:07:29,447 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:07:29,476 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:07:29,476 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-24 22:07:29,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:07:29 BoogieIcfgContainer [2023-12-24 22:07:29,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:07:29,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:07:29,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:07:29,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:07:29,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:07:28" (1/3) ... [2023-12-24 22:07:29,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df2df88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:07:29, skipping insertion in model container [2023-12-24 22:07:29,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:29" (2/3) ... [2023-12-24 22:07:29,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df2df88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:07:29, skipping insertion in model container [2023-12-24 22:07:29,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:07:29" (3/3) ... [2023-12-24 22:07:29,482 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string-1.c [2023-12-24 22:07:29,493 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:07:29,493 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:07:29,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:07:29,527 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;@7676ef12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:07:29,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:07:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-24 22:07:29,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:29,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:29,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:29,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:29,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2067232828, now seen corresponding path program 1 times [2023-12-24 22:07:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:29,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754526551] [2023-12-24 22:07:29,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:29,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:29,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:29,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:29,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 22:07:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:29,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 22:07:29,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:29,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:29,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754526551] [2023-12-24 22:07:29,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754526551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:29,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:29,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 22:07:29,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003559885] [2023-12-24 22:07:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:29,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 22:07:29,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 22:07:29,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 22:07:29,712 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:29,741 INFO L93 Difference]: Finished difference Result 26 states and 39 transitions. [2023-12-24 22:07:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 22:07:29,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-24 22:07:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:29,747 INFO L225 Difference]: With dead ends: 26 [2023-12-24 22:07:29,748 INFO L226 Difference]: Without dead ends: 12 [2023-12-24 22:07:29,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 22:07:29,752 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:29,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-24 22:07:29,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-24 22:07:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-12-24 22:07:29,771 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2023-12-24 22:07:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:29,771 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-12-24 22:07:29,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-12-24 22:07:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-24 22:07:29,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:29,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:29,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:29,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:29,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:29,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1872196922, now seen corresponding path program 1 times [2023-12-24 22:07:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:29,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039102912] [2023-12-24 22:07:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:29,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:29,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:29,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:29,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 22:07:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:30,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 22:07:30,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:30,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:30,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:30,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039102912] [2023-12-24 22:07:30,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039102912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:30,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:30,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 22:07:30,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130433798] [2023-12-24 22:07:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:30,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 22:07:30,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 22:07:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:07:30,074 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:30,122 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-12-24 22:07:30,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 22:07:30,122 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-24 22:07:30,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:30,123 INFO L225 Difference]: With dead ends: 26 [2023-12-24 22:07:30,123 INFO L226 Difference]: Without dead ends: 20 [2023-12-24 22:07:30,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:07:30,124 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:30,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:30,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-24 22:07:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2023-12-24 22:07:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-12-24 22:07:30,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2023-12-24 22:07:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:30,131 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-12-24 22:07:30,131 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-12-24 22:07:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-24 22:07:30,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:30,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:30,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:30,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:30,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:30,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash -925271762, now seen corresponding path program 1 times [2023-12-24 22:07:30,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:30,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742410842] [2023-12-24 22:07:30,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:30,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:30,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:30,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:30,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 22:07:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:30,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:07:30,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:07:30,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:30,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:30,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742410842] [2023-12-24 22:07:30,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742410842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:30,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:30,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 22:07:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281605290] [2023-12-24 22:07:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:30,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 22:07:30,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:30,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 22:07:30,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:07:30,430 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:30,476 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-12-24 22:07:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 22:07:30,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-24 22:07:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:30,477 INFO L225 Difference]: With dead ends: 28 [2023-12-24 22:07:30,477 INFO L226 Difference]: Without dead ends: 19 [2023-12-24 22:07:30,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:07:30,478 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:30,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:30,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-24 22:07:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2023-12-24 22:07:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-24 22:07:30,482 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2023-12-24 22:07:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:30,482 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-24 22:07:30,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-24 22:07:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 22:07:30,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:30,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:30,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:30,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:30,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:30,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash 293729291, now seen corresponding path program 1 times [2023-12-24 22:07:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:30,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361302245] [2023-12-24 22:07:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:30,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:30,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:30,709 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:30,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 22:07:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:30,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 22:07:30,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:30,859 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 14 treesize of output 10 [2023-12-24 22:07:30,940 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 17 treesize of output 13 [2023-12-24 22:07:31,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:07:31,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:31,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 45 [2023-12-24 22:07:31,170 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:07:31,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:31,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 36 [2023-12-24 22:07:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:07:31,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:31,340 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 29 treesize of output 27 [2023-12-24 22:07:31,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 42 [2023-12-24 22:07:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:07:31,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:31,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361302245] [2023-12-24 22:07:31,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361302245] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:31,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:31,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-24 22:07:31,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404211163] [2023-12-24 22:07:31,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:31,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 22:07:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:31,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 22:07:31,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-24 22:07:31,423 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:36,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:07:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:36,642 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2023-12-24 22:07:36,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 22:07:36,643 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-24 22:07:36,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:36,643 INFO L225 Difference]: With dead ends: 46 [2023-12-24 22:07:36,643 INFO L226 Difference]: Without dead ends: 44 [2023-12-24 22:07:36,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2023-12-24 22:07:36,644 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 91 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:36,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 43 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 104 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-12-24 22:07:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-24 22:07:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 19. [2023-12-24 22:07:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-24 22:07:36,649 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2023-12-24 22:07:36,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:36,650 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-24 22:07:36,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-24 22:07:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-24 22:07:36,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:36,650 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:36,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:36,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:36,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:36,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1763574347, now seen corresponding path program 2 times [2023-12-24 22:07:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103620759] [2023-12-24 22:07:36,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:07:36,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:36,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:36,853 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:36,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 22:07:36,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:07:36,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:36,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 22:07:36,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:36,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:37,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:37,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103620759] [2023-12-24 22:07:37,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103620759] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:37,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:37,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-24 22:07:37,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979829146] [2023-12-24 22:07:37,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:37,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 22:07:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:37,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 22:07:37,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2023-12-24 22:07:37,216 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:38,472 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2023-12-24 22:07:38,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-24 22:07:38,473 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-24 22:07:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:38,473 INFO L225 Difference]: With dead ends: 118 [2023-12-24 22:07:38,474 INFO L226 Difference]: Without dead ends: 99 [2023-12-24 22:07:38,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=399, Invalid=1161, Unknown=0, NotChecked=0, Total=1560 [2023-12-24 22:07:38,475 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 337 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:38,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 80 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 22:07:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-24 22:07:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 27. [2023-12-24 22:07:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-12-24 22:07:38,505 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2023-12-24 22:07:38,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:38,505 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-12-24 22:07:38,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-12-24 22:07:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-24 22:07:38,506 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:38,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:38,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 22:07:38,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:38,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:38,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash 794133163, now seen corresponding path program 3 times [2023-12-24 22:07:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:38,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416072172] [2023-12-24 22:07:38,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:07:38,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:38,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:38,713 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:38,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 22:07:38,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 22:07:38,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:38,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 22:07:38,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:38,972 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 17 treesize of output 13 [2023-12-24 22:07:39,200 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:07:39,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:39,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 45 [2023-12-24 22:07:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:07:39,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:39,366 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 29 treesize of output 21 [2023-12-24 22:07:39,369 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 21 treesize of output 19 [2023-12-24 22:07:39,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 30 [2023-12-24 22:07:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 22:07:39,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:39,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416072172] [2023-12-24 22:07:39,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416072172] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:39,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2023-12-24 22:07:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543366052] [2023-12-24 22:07:39,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:39,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 22:07:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 22:07:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2023-12-24 22:07:39,536 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:44,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:08:35,250 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2023-12-24 22:08:35,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-24 22:08:35,250 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-24 22:08:35,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:08:35,251 INFO L225 Difference]: With dead ends: 123 [2023-12-24 22:08:35,251 INFO L226 Difference]: Without dead ends: 121 [2023-12-24 22:08:35,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 51.4s TimeCoverageRelationStatistics Valid=979, Invalid=3299, Unknown=12, NotChecked=0, Total=4290 [2023-12-24 22:08:35,253 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 275 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 67 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-24 22:08:35,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 122 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 335 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2023-12-24 22:08:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-24 22:08:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 31. [2023-12-24 22:08:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2023-12-24 22:08:35,263 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2023-12-24 22:08:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:08:35,263 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2023-12-24 22:08:35,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2023-12-24 22:08:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-24 22:08:35,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:08:35,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:08:35,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-24 22:08:35,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:35,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:08:35,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:08:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash -635258154, now seen corresponding path program 1 times [2023-12-24 22:08:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:08:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484111499] [2023-12-24 22:08:35,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:08:35,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:35,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:08:35,469 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:08:35,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 22:08:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:08:35,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 22:08:35,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:08:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 22:08:35,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:08:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 22:08:35,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:08:35,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484111499] [2023-12-24 22:08:35,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484111499] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:08:35,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:08:35,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-12-24 22:08:35,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979798807] [2023-12-24 22:08:35,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:08:35,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 22:08:35,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:08:35,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 22:08:35,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-24 22:08:35,676 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:35,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:08:35,857 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2023-12-24 22:08:35,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 22:08:35,858 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-24 22:08:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:08:35,859 INFO L225 Difference]: With dead ends: 56 [2023-12-24 22:08:35,859 INFO L226 Difference]: Without dead ends: 48 [2023-12-24 22:08:35,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2023-12-24 22:08:35,860 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 124 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:08:35,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 22 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:08:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-24 22:08:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2023-12-24 22:08:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2023-12-24 22:08:35,874 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 16 [2023-12-24 22:08:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:08:35,874 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2023-12-24 22:08:35,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2023-12-24 22:08:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 22:08:35,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:08:35,875 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:08:35,879 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 (8)] Ended with exit code 0 [2023-12-24 22:08:36,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:36,076 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:08:36,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:08:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash 882552842, now seen corresponding path program 2 times [2023-12-24 22:08:36,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:08:36,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119537851] [2023-12-24 22:08:36,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:08:36,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:36,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:08:36,078 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:08:36,082 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 (9)] Waiting until timeout for monitored process [2023-12-24 22:08:36,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:08:36,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-24 22:08:36,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-24 22:08:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 22:08:36,201 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-24 22:08:36,201 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-24 22:08:36,202 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:08:36,215 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 (9)] Ended with exit code 0 [2023-12-24 22:08:36,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:36,406 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2023-12-24 22:08:36,409 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:08:36,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:08:36 BoogieIcfgContainer [2023-12-24 22:08:36,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:08:36,427 INFO L158 Benchmark]: Toolchain (without parser) took 67461.59ms. Allocated memory was 278.9MB in the beginning and 335.5MB in the end (delta: 56.6MB). Free memory was 225.0MB in the beginning and 279.3MB in the end (delta: -54.2MB). Peak memory consumption was 3.5MB. Max. memory is 8.0GB. [2023-12-24 22:08:36,427 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 195.0MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:08:36,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.35ms. Allocated memory is still 278.9MB. Free memory was 224.6MB in the beginning and 213.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 22:08:36,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.75ms. Allocated memory is still 278.9MB. Free memory was 213.0MB in the beginning and 211.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:08:36,427 INFO L158 Benchmark]: Boogie Preprocessor took 30.52ms. Allocated memory is still 278.9MB. Free memory was 211.5MB in the beginning and 209.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:08:36,428 INFO L158 Benchmark]: RCFGBuilder took 278.76ms. Allocated memory is still 278.9MB. Free memory was 209.4MB in the beginning and 195.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 22:08:36,428 INFO L158 Benchmark]: TraceAbstraction took 66948.91ms. Allocated memory was 278.9MB in the beginning and 335.5MB in the end (delta: 56.6MB). Free memory was 194.7MB in the beginning and 279.3MB in the end (delta: -84.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:08:36,429 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.43ms. Allocated memory is still 195.0MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.35ms. Allocated memory is still 278.9MB. Free memory was 224.6MB in the beginning and 213.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.75ms. Allocated memory is still 278.9MB. Free memory was 213.0MB in the beginning and 211.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.52ms. Allocated memory is still 278.9MB. Free memory was 211.5MB in the beginning and 209.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 278.76ms. Allocated memory is still 278.9MB. Free memory was 209.4MB in the beginning and 195.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 66948.91ms. Allocated memory was 278.9MB in the beginning and 335.5MB in the end (delta: 56.6MB). Free memory was 194.7MB in the beginning and 279.3MB in the end (delta: -84.6MB). There was no memory consumed. 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: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int MAX = __VERIFIER_nondet_uint(); [L17] COND FALSE !(!(MAX > 0)) VAL [MAX=2] [L18] char str1[MAX], str2[MAX]; [L19] int cont, i, j; [L20] cont = 0 [L22] i=0 VAL [MAX=2, cont=0, i=0, str1={7:0}, str2={5:0}] [L22] COND TRUE i= 0 [L30] EXPR str1[0] [L30] str2[j] = str1[0] [L31] j++ [L29] i-- VAL [MAX=2, cont=0, i=0, j=1, str1={7:0}, str2={5:0}] [L29] COND TRUE i >= 0 [L30] EXPR str1[0] [L30] str2[j] = str1[0] [L31] j++ [L29] i-- VAL [MAX=2, cont=0, i=-1, j=2, str1={7:0}, str2={5:0}] [L29] COND FALSE !(i >= 0) VAL [MAX=2, cont=0, i=-1, j=2, str1={7:0}, str2={5:0}] [L34] j = MAX-1 [L35] i=0 VAL [MAX=2, cont=0, i=0, j=1, str1={7:0}, str2={5:0}] [L35] COND TRUE i