/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/array-fpi/brs3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 07:11:43,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 07:11:43,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 07:11:43,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 07:11:43,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 07:11:43,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 07:11:43,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 07:11:43,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 07:11:43,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 07:11:43,478 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 07:11:43,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 07:11:43,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 07:11:43,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 07:11:43,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 07:11:43,479 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 07:11:43,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 07:11:43,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 07:11:43,480 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 07:11:43,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 07:11:43,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 07:11:43,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 07:11:43,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 07:11:43,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 07:11:43,489 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 07:11:43,490 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 07:11:43,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 07:11:43,490 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 07:11:43,490 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 07:11:43,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 07:11:43,491 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 07:11:43,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 07:11:43,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 07:11:43,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 07:11:43,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 07:11:43,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:11:43,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 07:11:43,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 07:11:43,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 07:11:43,492 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 07:11:43,492 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 07:11:43,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 07:11:43,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 07:11:43,493 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 07:11:43,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 07:11:43,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 07:11:43,494 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 07:11:43,494 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 07:11:43,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 07:11:43,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 07:11:43,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 07:11:43,644 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 07:11:43,645 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 07:11:43,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs3.c [2023-12-16 07:11:44,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 07:11:44,916 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 07:11:44,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs3.c [2023-12-16 07:11:44,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a8c2e2a3/fff13cef9e7c4af082343ab02144b0cb/FLAG57bfdf011 [2023-12-16 07:11:44,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a8c2e2a3/fff13cef9e7c4af082343ab02144b0cb [2023-12-16 07:11:44,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 07:11:44,932 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 07:11:44,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 07:11:44,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 07:11:44,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 07:11:44,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:11:44" (1/1) ... [2023-12-16 07:11:44,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@553c2605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:44, skipping insertion in model container [2023-12-16 07:11:44,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:11:44" (1/1) ... [2023-12-16 07:11:44,949 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 07:11:45,052 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs3.c[587,600] [2023-12-16 07:11:45,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:11:45,092 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 07:11:45,105 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs3.c[587,600] [2023-12-16 07:11:45,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:11:45,130 INFO L206 MainTranslator]: Completed translation [2023-12-16 07:11:45,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45 WrapperNode [2023-12-16 07:11:45,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 07:11:45,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 07:11:45,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 07:11:45,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 07:11:45,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,161 INFO L138 Inliner]: procedures = 21, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2023-12-16 07:11:45,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 07:11:45,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 07:11:45,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 07:11:45,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 07:11:45,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,194 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 7, 4, 3]. 44 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2023-12-16 07:11:45,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 07:11:45,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 07:11:45,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 07:11:45,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 07:11:45,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (1/1) ... [2023-12-16 07:11:45,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:11:45,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 07:11:45,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 07:11:45,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 07:11:45,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 07:11:45,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 07:11:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 07:11:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 07:11:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 07:11:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 07:11:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-16 07:11:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-16 07:11:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-16 07:11:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-16 07:11:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 07:11:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 07:11:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 07:11:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 07:11:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-16 07:11:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 07:11:45,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 07:11:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-16 07:11:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-16 07:11:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-16 07:11:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-16 07:11:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 07:11:45,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 07:11:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 07:11:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 07:11:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-16 07:11:45,342 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 07:11:45,343 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 07:11:45,535 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 07:11:45,556 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 07:11:45,556 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 07:11:45,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:11:45 BoogieIcfgContainer [2023-12-16 07:11:45,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 07:11:45,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 07:11:45,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 07:11:45,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 07:11:45,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:11:44" (1/3) ... [2023-12-16 07:11:45,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@805efd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:11:45, skipping insertion in model container [2023-12-16 07:11:45,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:11:45" (2/3) ... [2023-12-16 07:11:45,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@805efd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:11:45, skipping insertion in model container [2023-12-16 07:11:45,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:11:45" (3/3) ... [2023-12-16 07:11:45,562 INFO L112 eAbstractionObserver]: Analyzing ICFG brs3.c [2023-12-16 07:11:45,573 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 07:11:45,573 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 07:11:45,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 07:11:45,604 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;@600f1eab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 07:11:45,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 07:11:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 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-16 07:11:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 07:11:45,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:45,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:11:45,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:45,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1256235845, now seen corresponding path program 1 times [2023-12-16 07:11:45,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:45,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831309178] [2023-12-16 07:11:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:11:45,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:11:45,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:45,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:11:45,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 07:11:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:11:45,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 07:11:45,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:45,786 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-16 07:11:45,786 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:11:45,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:45,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831309178] [2023-12-16 07:11:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831309178] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:11:45,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:11:45,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:11:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269367411] [2023-12-16 07:11:45,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:11:45,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 07:11:45,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:45,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 07:11:45,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:11:45,821 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 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-16 07:11:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:45,836 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2023-12-16 07:11:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 07:11:45,838 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-16 07:11:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:45,844 INFO L225 Difference]: With dead ends: 33 [2023-12-16 07:11:45,844 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 07:11:45,847 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-16 07:11:45,851 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:45,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:11:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 07:11:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-16 07:11:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-16 07:11:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-16 07:11:45,879 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2023-12-16 07:11:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:45,879 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-16 07:11:45,879 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-16 07:11:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-16 07:11:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 07:11:45,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:45,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:11:45,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 07:11:46,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:11:46,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:46,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2065910172, now seen corresponding path program 1 times [2023-12-16 07:11:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032411288] [2023-12-16 07:11:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:11:46,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:11:46,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:46,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:11:46,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 07:11:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:11:46,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:11:46,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:46,280 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-16 07:11:46,280 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:11:46,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:46,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032411288] [2023-12-16 07:11:46,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032411288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:11:46,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:11:46,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 07:11:46,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555435397] [2023-12-16 07:11:46,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:11:46,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:11:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:46,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:11:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:11:46,289 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-16 07:11:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:46,456 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2023-12-16 07:11:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 07:11:46,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-16 07:11:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:46,459 INFO L225 Difference]: With dead ends: 32 [2023-12-16 07:11:46,459 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 07:11:46,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:11:46,460 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:46,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 13 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:11:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 07:11:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-12-16 07:11:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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-16 07:11:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-16 07:11:46,464 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2023-12-16 07:11:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:46,464 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-16 07:11:46,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-16 07:11:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-16 07:11:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 07:11:46,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:46,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:11:46,475 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 (3)] Ended with exit code 0 [2023-12-16 07:11:46,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:11:46,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:46,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash 785079709, now seen corresponding path program 1 times [2023-12-16 07:11:46,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:46,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867308159] [2023-12-16 07:11:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:11:46,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:11:46,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:46,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:11:46,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 07:11:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:11:46,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 07:11:46,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:46,850 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 07:11:46,855 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 18 treesize of output 19 [2023-12-16 07:11:46,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:11:46,932 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 65 treesize of output 35 [2023-12-16 07:11:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:11:46,951 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:11:46,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:46,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867308159] [2023-12-16 07:11:46,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867308159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:11:46,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:11:46,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 07:11:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199667668] [2023-12-16 07:11:46,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:11:46,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 07:11:46,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:46,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 07:11:46,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:11:46,953 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-16 07:11:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:47,032 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-12-16 07:11:47,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 07:11:47,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) Word has length 16 [2023-12-16 07:11:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:47,033 INFO L225 Difference]: With dead ends: 26 [2023-12-16 07:11:47,033 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 07:11:47,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 07:11:47,034 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:47,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:11:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 07:11:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-12-16 07:11:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-16 07:11:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-12-16 07:11:47,047 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2023-12-16 07:11:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:47,047 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-12-16 07:11:47,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-16 07:11:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-12-16 07:11:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 07:11:47,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:47,048 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:11:47,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 07:11:47,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:11:47,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:47,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash -485999892, now seen corresponding path program 1 times [2023-12-16 07:11:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:47,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736554544] [2023-12-16 07:11:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:11:47,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:11:47,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:47,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:11:47,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 07:11:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:11:47,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 07:11:47,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:47,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:11:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:47,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:47,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736554544] [2023-12-16 07:11:47,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736554544] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:11:47,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:11:47,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-16 07:11:47,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571242915] [2023-12-16 07:11:47,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:11:47,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 07:11:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:47,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 07:11:47,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-16 07:11:47,584 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:11:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:47,810 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-12-16 07:11:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 07:11:47,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-16 07:11:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:47,812 INFO L225 Difference]: With dead ends: 47 [2023-12-16 07:11:47,812 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 07:11:47,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-16 07:11:47,813 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:47,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 17 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:11:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 07:11:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-12-16 07:11:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-16 07:11:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-16 07:11:47,816 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2023-12-16 07:11:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:47,816 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-16 07:11:47,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:11:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-16 07:11:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 07:11:47,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:47,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:11:47,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 07:11:48,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:11:48,022 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:48,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash -105964608, now seen corresponding path program 1 times [2023-12-16 07:11:48,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:48,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751536359] [2023-12-16 07:11:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:11:48,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:11:48,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:48,024 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-16 07:11:48,026 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-16 07:11:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:11:48,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 07:11:48,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:48,185 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 13 treesize of output 9 [2023-12-16 07:11:48,271 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 07:11:48,273 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 18 treesize of output 19 [2023-12-16 07:11:48,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:11:48,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 67 treesize of output 37 [2023-12-16 07:11:48,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:11:48,502 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 79 treesize of output 49 [2023-12-16 07:11:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:48,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:11:48,830 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 50 treesize of output 46 [2023-12-16 07:11:48,833 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 70 treesize of output 62 [2023-12-16 07:11:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:49,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:49,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751536359] [2023-12-16 07:11:49,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751536359] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:11:49,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:11:49,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-12-16 07:11:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923763084] [2023-12-16 07:11:49,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:11:49,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 07:11:49,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:49,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 07:11:49,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-12-16 07:11:49,115 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 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-16 07:11:53,756 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-16 07:11:57,765 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-16 07:11:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:58,444 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2023-12-16 07:11:58,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 07:11:58,445 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 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 22 [2023-12-16 07:11:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:58,445 INFO L225 Difference]: With dead ends: 54 [2023-12-16 07:11:58,445 INFO L226 Difference]: Without dead ends: 48 [2023-12-16 07:11:58,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 07:11:58,446 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 124 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:58,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 35 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 287 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2023-12-16 07:11:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-16 07:11:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 27. [2023-12-16 07:11:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:11:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-16 07:11:58,451 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2023-12-16 07:11:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:58,451 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-16 07:11:58,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 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-16 07:11:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-16 07:11:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 07:11:58,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:58,452 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:11:58,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 07:11:58,652 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-16 07:11:58,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:58,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1605608937, now seen corresponding path program 2 times [2023-12-16 07:11:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:58,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260024251] [2023-12-16 07:11:58,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:11:58,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:11:58,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:58,655 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-16 07:11:58,674 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-16 07:11:58,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 07:11:58,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:11:58,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 07:11:58,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:58,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:11:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:59,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:59,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260024251] [2023-12-16 07:11:59,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260024251] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:11:59,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:11:59,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-12-16 07:11:59,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066825039] [2023-12-16 07:11:59,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:11:59,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 07:11:59,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:59,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 07:11:59,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-12-16 07:11:59,229 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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-16 07:12:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:00,231 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2023-12-16 07:12:00,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-16 07:12:00,231 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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 25 [2023-12-16 07:12:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:00,233 INFO L225 Difference]: With dead ends: 91 [2023-12-16 07:12:00,233 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 07:12:00,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=1127, Unknown=0, NotChecked=0, Total=1482 [2023-12-16 07:12:00,234 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 117 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:00,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 31 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 07:12:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 07:12:00,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2023-12-16 07:12:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 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-16 07:12:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-12-16 07:12:00,242 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 25 [2023-12-16 07:12:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:00,242 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-12-16 07:12:00,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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-16 07:12:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-12-16 07:12:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 07:12:00,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:00,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:00,246 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-16 07:12:00,448 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-16 07:12:00,448 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:00,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:00,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1537501251, now seen corresponding path program 3 times [2023-12-16 07:12:00,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:00,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115872222] [2023-12-16 07:12:00,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:12:00,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:00,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:00,450 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-16 07:12:00,478 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-16 07:12:00,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 07:12:00,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:12:00,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 07:12:00,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:00,695 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 13 treesize of output 9 [2023-12-16 07:12:00,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 22 [2023-12-16 07:12:00,838 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 07:12:00,839 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 18 treesize of output 19 [2023-12-16 07:12:00,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:00,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 67 treesize of output 37 [2023-12-16 07:12:01,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:01,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 67 treesize of output 37 [2023-12-16 07:12:01,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:01,256 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 79 treesize of output 49 [2023-12-16 07:12:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:01,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:02,314 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 178 treesize of output 166 [2023-12-16 07:12:02,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:02,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1138 treesize of output 1042 [2023-12-16 07:12:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:04,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:04,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115872222] [2023-12-16 07:12:04,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115872222] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:12:04,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:12:04,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2023-12-16 07:12:04,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765560413] [2023-12-16 07:12:04,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:12:04,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-16 07:12:04,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:04,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-16 07:12:04,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2023-12-16 07:12:04,782 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 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-16 07:12:12,670 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-16 07:12:16,674 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-16 07:12:22,280 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-16 07:12:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:22,554 INFO L93 Difference]: Finished difference Result 126 states and 152 transitions. [2023-12-16 07:12:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-16 07:12:22,556 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 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 28 [2023-12-16 07:12:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:22,557 INFO L225 Difference]: With dead ends: 126 [2023-12-16 07:12:22,557 INFO L226 Difference]: Without dead ends: 122 [2023-12-16 07:12:22,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=367, Invalid=1613, Unknown=0, NotChecked=0, Total=1980 [2023-12-16 07:12:22,558 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 138 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:22,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 39 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 397 Invalid, 3 Unknown, 0 Unchecked, 14.8s Time] [2023-12-16 07:12:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-16 07:12:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 53. [2023-12-16 07:12:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 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-16 07:12:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-12-16 07:12:22,565 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 28 [2023-12-16 07:12:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:22,565 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-12-16 07:12:22,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 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-16 07:12:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-12-16 07:12:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 07:12:22,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:22,566 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:22,572 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-16 07:12:22,770 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-16 07:12:22,771 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:22,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:22,771 INFO L85 PathProgramCache]: Analyzing trace with hash -572240692, now seen corresponding path program 4 times [2023-12-16 07:12:22,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:22,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533731537] [2023-12-16 07:12:22,771 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 07:12:22,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:22,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:22,772 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-16 07:12:22,775 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-16 07:12:22,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 07:12:22,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:12:22,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 07:12:22,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:23,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:23,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:12:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533731537] [2023-12-16 07:12:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533731537] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:12:23,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:12:23,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2023-12-16 07:12:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085871919] [2023-12-16 07:12:23,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:12:23,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-16 07:12:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:12:23,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-16 07:12:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2023-12-16 07:12:23,522 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 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-16 07:12:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:12:24,051 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2023-12-16 07:12:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 07:12:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 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 31 [2023-12-16 07:12:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:12:24,052 INFO L225 Difference]: With dead ends: 116 [2023-12-16 07:12:24,052 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 07:12:24,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2023-12-16 07:12:24,053 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 66 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 07:12:24,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 33 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 07:12:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 07:12:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2023-12-16 07:12:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 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-16 07:12:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2023-12-16 07:12:24,060 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 31 [2023-12-16 07:12:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:12:24,060 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2023-12-16 07:12:24,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 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-16 07:12:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2023-12-16 07:12:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 07:12:24,061 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:12:24,061 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:12:24,087 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-16 07:12:24,263 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-16 07:12:24,264 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:12:24,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:12:24,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2038897950, now seen corresponding path program 5 times [2023-12-16 07:12:24,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:12:24,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606238001] [2023-12-16 07:12:24,264 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 07:12:24,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:12:24,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:12:24,266 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:12:24,270 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 (10)] Waiting until timeout for monitored process [2023-12-16 07:12:24,498 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-12-16 07:12:24,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:12:24,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-16 07:12:24,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:12:24,566 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 11 treesize of output 7 [2023-12-16 07:12:24,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-16 07:12:24,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:24,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-16 07:12:24,918 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 07:12:24,919 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 18 treesize of output 19 [2023-12-16 07:12:25,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:25,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 67 treesize of output 37 [2023-12-16 07:12:25,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:25,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 67 treesize of output 37 [2023-12-16 07:12:25,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:25,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 67 treesize of output 37 [2023-12-16 07:12:25,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:25,566 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 79 treesize of output 49 [2023-12-16 07:12:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:12:25,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:12:32,618 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 514 treesize of output 486 [2023-12-16 07:12:32,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 07:12:32,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267250 treesize of output 252914 Received shutdown request... [2023-12-16 07:13:02,196 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:13:02,199 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:13:02,208 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 07:13:02,217 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 (10)] Forceful destruction successful, exit code 0 [2023-12-16 07:13:02,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:13:02,409 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∨-3-3-3-8-3-5-3-3-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. [2023-12-16 07:13:02,413 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2023-12-16 07:13:02,415 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:13:02,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:13:02 BoogieIcfgContainer [2023-12-16 07:13:02,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:13:02,433 INFO L158 Benchmark]: Toolchain (without parser) took 77500.05ms. Allocated memory was 198.2MB in the beginning and 310.4MB in the end (delta: 112.2MB). Free memory was 148.5MB in the beginning and 232.0MB in the end (delta: -83.5MB). Peak memory consumption was 162.5MB. Max. memory is 8.0GB. [2023-12-16 07:13:02,433 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:13:02,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.36ms. Allocated memory is still 198.2MB. Free memory was 148.2MB in the beginning and 136.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 07:13:02,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.17ms. Allocated memory is still 198.2MB. Free memory was 136.3MB in the beginning and 134.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 07:13:02,436 INFO L158 Benchmark]: Boogie Preprocessor took 44.50ms. Allocated memory is still 198.2MB. Free memory was 134.8MB in the beginning and 132.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 07:13:02,436 INFO L158 Benchmark]: RCFGBuilder took 349.68ms. Allocated memory is still 198.2MB. Free memory was 132.4MB in the beginning and 117.4MB in the end (delta: 15.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 07:13:02,436 INFO L158 Benchmark]: TraceAbstraction took 76874.20ms. Allocated memory was 198.2MB in the beginning and 310.4MB in the end (delta: 112.2MB). Free memory was 116.8MB in the beginning and 232.0MB in the end (delta: -115.3MB). Peak memory consumption was 131.1MB. Max. memory is 8.0GB. [2023-12-16 07:13:02,439 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.13ms. Allocated memory is still 198.2MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.36ms. Allocated memory is still 198.2MB. Free memory was 148.2MB in the beginning and 136.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.17ms. Allocated memory is still 198.2MB. Free memory was 136.3MB in the beginning and 134.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.50ms. Allocated memory is still 198.2MB. Free memory was 134.8MB in the beginning and 132.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 349.68ms. Allocated memory is still 198.2MB. Free memory was 132.4MB in the beginning and 117.4MB in the end (delta: 15.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 76874.20ms. Allocated memory was 198.2MB in the beginning and 310.4MB in the end (delta: 112.2MB). Free memory was 116.8MB in the beginning and 232.0MB in the end (delta: -115.3MB). Peak memory consumption was 131.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∨-3-3-3-8-3-5-3-3-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.8s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 513 SdHoareTripleChecker+Valid, 24.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 24.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1582 IncrementalHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 59 mSDtfsCounter, 1582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=8, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 114 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 273 ConstructedInterpolants, 10 QuantifiedInterpolants, 8526 SizeOfPredicates, 57 NumberOfNonLiveVariables, 545 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 46/184 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown