/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/reducercommutativity/rangesum20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 06:54:51,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 06:54:51,764 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 06:54:51,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 06:54:51,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 06:54:51,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 06:54:51,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 06:54:51,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 06:54:51,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 06:54:51,792 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 06:54:51,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 06:54:51,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 06:54:51,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 06:54:51,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 06:54:51,794 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 06:54:51,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 06:54:51,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 06:54:51,795 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 06:54:51,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 06:54:51,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 06:54:51,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 06:54:51,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 06:54:51,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 06:54:51,796 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 06:54:51,797 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 06:54:51,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 06:54:51,797 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 06:54:51,797 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 06:54:51,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 06:54:51,797 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 06:54:51,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 06:54:51,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 06:54:51,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 06:54:51,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 06:54:51,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:54:51,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 06:54:51,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 06:54:51,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 06:54:51,799 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 06:54:51,799 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 06:54:51,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 06:54:51,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 06:54:51,799 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 06:54:51,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 06:54:51,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 06:54:51,800 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 06:54:51,800 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 06:54:51,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 06:54:51,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 06:54:51,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 06:54:51,988 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 06:54:51,988 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 06:54:51,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum20.i [2023-12-16 06:54:52,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 06:54:53,104 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 06:54:53,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum20.i [2023-12-16 06:54:53,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf2afa34/a9302c97619340808753c900f7f0dd8e/FLAGc45736bb7 [2023-12-16 06:54:53,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf2afa34/a9302c97619340808753c900f7f0dd8e [2023-12-16 06:54:53,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 06:54:53,121 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 06:54:53,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 06:54:53,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 06:54:53,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 06:54:53,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe857dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53, skipping insertion in model container [2023-12-16 06:54:53,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,141 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:54:53,260 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum20.i[1465,1478] [2023-12-16 06:54:53,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:54:53,274 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 06:54:53,288 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum20.i[1465,1478] [2023-12-16 06:54:53,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:54:53,297 INFO L206 MainTranslator]: Completed translation [2023-12-16 06:54:53,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53 WrapperNode [2023-12-16 06:54:53,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 06:54:53,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 06:54:53,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 06:54:53,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 06:54:53,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,318 INFO L138 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2023-12-16 06:54:53,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 06:54:53,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 06:54:53,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 06:54:53,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 06:54:53,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,335 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-12-16 06:54:53,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 06:54:53,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 06:54:53,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 06:54:53,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 06:54:53,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (1/1) ... [2023-12-16 06:54:53,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:54:53,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:54:53,371 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 06:54:53,392 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 06:54:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 06:54:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 06:54:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 06:54:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 06:54:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 06:54:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 06:54:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 06:54:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 06:54:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2023-12-16 06:54:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2023-12-16 06:54:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 06:54:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 06:54:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 06:54:53,470 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 06:54:53,472 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 06:54:53,927 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 06:54:53,952 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 06:54:53,952 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 06:54:53,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:54:53 BoogieIcfgContainer [2023-12-16 06:54:53,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 06:54:53,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 06:54:53,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 06:54:53,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 06:54:53,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:54:53" (1/3) ... [2023-12-16 06:54:53,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1129c192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:54:53, skipping insertion in model container [2023-12-16 06:54:53,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:54:53" (2/3) ... [2023-12-16 06:54:53,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1129c192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:54:53, skipping insertion in model container [2023-12-16 06:54:53,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:54:53" (3/3) ... [2023-12-16 06:54:53,958 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2023-12-16 06:54:53,968 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 06:54:53,968 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 06:54:54,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 06:54:54,012 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;@7af2b8a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 06:54:54,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 06:54:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:54:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 06:54:54,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:54,020 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:54,021 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:54,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1502132506, now seen corresponding path program 1 times [2023-12-16 06:54:54,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:54,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478509477] [2023-12-16 06:54:54,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:54,032 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 06:54:54,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:54,033 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 06:54:54,034 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 06:54:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:54,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 06:54:54,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 06:54:54,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:54:54,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:54,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478509477] [2023-12-16 06:54:54,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478509477] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:54:54,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:54:54,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:54:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93450982] [2023-12-16 06:54:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:54:54,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 06:54:54,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:54,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 06:54:54,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 06:54:54,371 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 06:54:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:54,401 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2023-12-16 06:54:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 06:54:54,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2023-12-16 06:54:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:54,407 INFO L225 Difference]: With dead ends: 44 [2023-12-16 06:54:54,407 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 06:54:54,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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 06:54:54,411 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:54,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:54:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 06:54:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-16 06:54:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:54:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-12-16 06:54:54,432 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 28 [2023-12-16 06:54:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:54,433 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-12-16 06:54:54,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 06:54:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2023-12-16 06:54:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 06:54:54,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:54,434 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:54,447 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 06:54:54,646 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 06:54:54,647 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:54,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:54,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1260265879, now seen corresponding path program 1 times [2023-12-16 06:54:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:54,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872980346] [2023-12-16 06:54:54,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:54,649 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 06:54:54,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:54,650 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 06:54:54,650 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 06:54:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:54,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:54:54,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 06:54:54,983 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:54:54,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:54,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872980346] [2023-12-16 06:54:54,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872980346] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:54:54,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:54:54,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:54:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196880795] [2023-12-16 06:54:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:54:54,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:54:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:54,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:54:54,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:54,985 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 06:54:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:55,016 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-12-16 06:54:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:54:55,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-12-16 06:54:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:55,018 INFO L225 Difference]: With dead ends: 41 [2023-12-16 06:54:55,018 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 06:54:55,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:55,019 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:55,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:54:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 06:54:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-16 06:54:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:54:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-16 06:54:55,023 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 28 [2023-12-16 06:54:55,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:55,023 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-16 06:54:55,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 06:54:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-16 06:54:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 06:54:55,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:55,024 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:55,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:55,225 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 06:54:55,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:55,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:55,226 INFO L85 PathProgramCache]: Analyzing trace with hash -432814053, now seen corresponding path program 1 times [2023-12-16 06:54:55,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:55,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992869739] [2023-12-16 06:54:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:55,227 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 06:54:55,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:55,229 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 06:54:55,232 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 06:54:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:55,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:54:55,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 06:54:55,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 06:54:55,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:55,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992869739] [2023-12-16 06:54:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992869739] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:55,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:55,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-16 06:54:55,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804491246] [2023-12-16 06:54:55,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:55,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:54:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:55,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:54:55,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:54:55,620 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 06:54:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:55,674 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2023-12-16 06:54:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:54:55,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 29 [2023-12-16 06:54:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:55,676 INFO L225 Difference]: With dead ends: 44 [2023-12-16 06:54:55,676 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 06:54:55,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:54:55,679 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:55,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:54:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 06:54:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-16 06:54:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:54:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-12-16 06:54:55,688 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2023-12-16 06:54:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:55,688 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-12-16 06:54:55,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 06:54:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-12-16 06:54:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 06:54:55,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:55,690 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:55,704 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 06:54:55,899 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 06:54:55,899 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:55,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1860680425, now seen corresponding path program 2 times [2023-12-16 06:54:55,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:55,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913934803] [2023-12-16 06:54:55,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:54:55,901 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 06:54:55,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:55,904 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 06:54:55,906 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 06:54:56,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 06:54:56,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:54:56,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:54:56,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 06:54:56,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:54:56,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:56,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913934803] [2023-12-16 06:54:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913934803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:54:56,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:54:56,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:54:56,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051288547] [2023-12-16 06:54:56,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:54:56,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:54:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:54:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:56,028 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 06:54:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:56,062 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2023-12-16 06:54:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:54:56,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2023-12-16 06:54:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:56,065 INFO L225 Difference]: With dead ends: 45 [2023-12-16 06:54:56,065 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 06:54:56,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:56,070 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:56,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:54:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 06:54:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-12-16 06:54:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:54:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-16 06:54:56,075 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32 [2023-12-16 06:54:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:56,076 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-16 06:54:56,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 06:54:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-16 06:54:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 06:54:56,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:56,077 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:56,088 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 (5)] Ended with exit code 0 [2023-12-16 06:54:56,277 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 06:54:56,278 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:56,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1838186572, now seen corresponding path program 1 times [2023-12-16 06:54:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650310676] [2023-12-16 06:54:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:56,279 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 06:54:56,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:56,283 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 06:54:56,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 06:54:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:56,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 06:54:56,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-16 06:54:56,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-16 06:54:56,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:56,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650310676] [2023-12-16 06:54:56,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650310676] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:56,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:56,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-16 06:54:56,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432385426] [2023-12-16 06:54:56,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:56,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:54:56,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:56,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:54:56,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:54:56,739 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 06:54:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:56,907 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-12-16 06:54:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:54:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2023-12-16 06:54:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:56,910 INFO L225 Difference]: With dead ends: 54 [2023-12-16 06:54:56,910 INFO L226 Difference]: Without dead ends: 33 [2023-12-16 06:54:56,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-16 06:54:56,911 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:56,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:54:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-16 06:54:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-16 06:54:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:54:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-12-16 06:54:56,915 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 41 [2023-12-16 06:54:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:56,915 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-12-16 06:54:56,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 06:54:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-12-16 06:54:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 06:54:56,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:56,916 INFO L195 NwaCegarLoop]: trace histogram [10, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:56,945 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 06:54:57,117 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 06:54:57,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:57,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:57,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1916929268, now seen corresponding path program 2 times [2023-12-16 06:54:57,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:57,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839303265] [2023-12-16 06:54:57,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:54:57,118 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 06:54:57,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:57,119 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 06:54:57,120 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 06:54:57,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 06:54:57,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:54:57,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:54:57,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-16 06:54:57,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:54:57,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839303265] [2023-12-16 06:54:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839303265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:54:57,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:54:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:54:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997877953] [2023-12-16 06:54:57,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:54:57,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:54:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:57,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:54:57,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:57,253 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 06:54:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:57,403 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2023-12-16 06:54:57,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:54:57,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2023-12-16 06:54:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:57,406 INFO L225 Difference]: With dead ends: 58 [2023-12-16 06:54:57,406 INFO L226 Difference]: Without dead ends: 39 [2023-12-16 06:54:57,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:54:57,407 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:57,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:54:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-16 06:54:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-12-16 06:54:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:54:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-12-16 06:54:57,413 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 47 [2023-12-16 06:54:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:57,414 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-12-16 06:54:57,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 06:54:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-12-16 06:54:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 06:54:57,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:57,415 INFO L195 NwaCegarLoop]: trace histogram [10, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:57,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:57,625 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 06:54:57,625 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:57,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash 693749521, now seen corresponding path program 1 times [2023-12-16 06:54:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:57,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713068479] [2023-12-16 06:54:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:57,626 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 06:54:57,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:57,627 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 06:54:57,628 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 06:54:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:57,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 06:54:57,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-16 06:54:57,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-16 06:54:58,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713068479] [2023-12-16 06:54:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713068479] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:58,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2023-12-16 06:54:58,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003349104] [2023-12-16 06:54:58,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:58,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 06:54:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:58,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 06:54:58,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2023-12-16 06:54:58,220 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 06:54:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:58,904 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2023-12-16 06:54:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 06:54:58,905 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 47 [2023-12-16 06:54:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:58,906 INFO L225 Difference]: With dead ends: 72 [2023-12-16 06:54:58,906 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 06:54:58,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2023-12-16 06:54:58,907 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:58,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:54:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 06:54:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-16 06:54:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:54:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2023-12-16 06:54:58,913 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 47 [2023-12-16 06:54:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:58,913 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2023-12-16 06:54:58,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 06:54:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2023-12-16 06:54:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 06:54:58,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:58,914 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:58,919 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 (8)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:59,117 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 06:54:59,118 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:59,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash 263622609, now seen corresponding path program 2 times [2023-12-16 06:54:59,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:59,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160942863] [2023-12-16 06:54:59,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:54:59,119 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 06:54:59,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:59,122 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 06:54:59,126 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 06:54:59,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:54:59,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:54:59,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:54:59,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-16 06:54:59,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2023-12-16 06:54:59,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160942863] [2023-12-16 06:54:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160942863] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:59,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:59,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 06:54:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420221166] [2023-12-16 06:54:59,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:59,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:54:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:59,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:54:59,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:54:59,270 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 06:54:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:54:59,333 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2023-12-16 06:54:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:54:59,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-12-16 06:54:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:54:59,334 INFO L225 Difference]: With dead ends: 77 [2023-12-16 06:54:59,334 INFO L226 Difference]: Without dead ends: 54 [2023-12-16 06:54:59,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:54:59,335 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:54:59,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 56 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:54:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-16 06:54:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2023-12-16 06:54:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:54:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2023-12-16 06:54:59,341 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 57 [2023-12-16 06:54:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:54:59,341 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2023-12-16 06:54:59,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 06:54:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2023-12-16 06:54:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 06:54:59,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:54:59,342 INFO L195 NwaCegarLoop]: trace histogram [20, 12, 12, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:54:59,352 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 (9)] Forceful destruction successful, exit code 0 [2023-12-16 06:54:59,552 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 06:54:59,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:54:59,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:54:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash 514515689, now seen corresponding path program 1 times [2023-12-16 06:54:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:54:59,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180785152] [2023-12-16 06:54:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:54:59,553 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 06:54:59,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:54:59,554 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 06:54:59,555 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 06:54:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:54:59,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 06:54:59,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:54:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 85 proven. 7 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2023-12-16 06:54:59,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:54:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 13 proven. 127 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2023-12-16 06:54:59,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:54:59,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180785152] [2023-12-16 06:54:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180785152] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:54:59,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:54:59,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 06:54:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290376155] [2023-12-16 06:54:59,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:54:59,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:54:59,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:54:59,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:54:59,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:54:59,972 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 06:55:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:55:00,068 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2023-12-16 06:55:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 06:55:00,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2023-12-16 06:55:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:55:00,070 INFO L225 Difference]: With dead ends: 87 [2023-12-16 06:55:00,070 INFO L226 Difference]: Without dead ends: 60 [2023-12-16 06:55:00,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-16 06:55:00,070 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:55:00,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 129 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:55:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-16 06:55:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-16 06:55:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:55:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2023-12-16 06:55:00,075 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 84 [2023-12-16 06:55:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:55:00,076 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2023-12-16 06:55:00,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 06:55:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2023-12-16 06:55:00,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 06:55:00,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:55:00,077 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 18, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:55:00,094 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 06:55:00,292 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 06:55:00,292 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:55:00,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:55:00,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1365164942, now seen corresponding path program 2 times [2023-12-16 06:55:00,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:55:00,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609579555] [2023-12-16 06:55:00,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:55:00,293 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 06:55:00,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:55:00,294 INFO L229 MonitoredProcess]: Starting monitored process 11 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 06:55:00,296 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 (11)] Waiting until timeout for monitored process [2023-12-16 06:55:00,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:55:00,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:55:00,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 06:55:00,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:55:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 309 proven. 57 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-12-16 06:55:00,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:55:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 13 proven. 387 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2023-12-16 06:55:00,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:55:00,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609579555] [2023-12-16 06:55:00,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609579555] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:55:00,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:55:00,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-16 06:55:00,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611373549] [2023-12-16 06:55:00,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:55:00,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 06:55:00,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:55:00,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 06:55:00,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2023-12-16 06:55:00,869 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 06:55:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:55:01,079 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2023-12-16 06:55:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 06:55:01,083 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2023-12-16 06:55:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:55:01,084 INFO L225 Difference]: With dead ends: 111 [2023-12-16 06:55:01,084 INFO L226 Difference]: Without dead ends: 75 [2023-12-16 06:55:01,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2023-12-16 06:55:01,085 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:55:01,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 183 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:55:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-16 06:55:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-12-16 06:55:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 70 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:55:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-12-16 06:55:01,091 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 111 [2023-12-16 06:55:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:55:01,091 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-12-16 06:55:01,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 06:55:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-12-16 06:55:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-16 06:55:01,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:55:01,092 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 33, 20, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:55:01,108 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 06:55:01,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 06:55:01,304 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:55:01,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:55:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1742664217, now seen corresponding path program 3 times [2023-12-16 06:55:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:55:01,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020139927] [2023-12-16 06:55:01,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 06:55:01,305 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 06:55:01,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:55:01,306 INFO L229 MonitoredProcess]: Starting monitored process 12 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 06:55:01,325 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 (12)] Waiting until timeout for monitored process [2023-12-16 06:55:01,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 06:55:01,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:55:01,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:55:01,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:55:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 922 proven. 0 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2023-12-16 06:55:01,551 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:55:01,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:55:01,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020139927] [2023-12-16 06:55:01,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020139927] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:55:01,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:55:01,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:55:01,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82947125] [2023-12-16 06:55:01,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:55:01,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:55:01,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:55:01,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:55:01,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:55:01,553 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 06:55:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:55:01,574 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2023-12-16 06:55:01,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:55:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 156 [2023-12-16 06:55:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:55:01,578 INFO L225 Difference]: With dead ends: 123 [2023-12-16 06:55:01,578 INFO L226 Difference]: Without dead ends: 76 [2023-12-16 06:55:01,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:55:01,580 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:55:01,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:55:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-16 06:55:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-12-16 06:55:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:55:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-12-16 06:55:01,587 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 156 [2023-12-16 06:55:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:55:01,588 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-12-16 06:55:01,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 06:55:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-12-16 06:55:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-16 06:55:01,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:55:01,590 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 33, 20, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:55:01,604 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 (12)] Forceful destruction successful, exit code 0 [2023-12-16 06:55:01,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 06:55:01,796 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:55:01,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:55:01,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1220443086, now seen corresponding path program 1 times [2023-12-16 06:55:01,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:55:01,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866102720] [2023-12-16 06:55:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:55:01,797 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 06:55:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:55:01,798 INFO L229 MonitoredProcess]: Starting monitored process 13 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 06:55:01,807 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 (13)] Waiting until timeout for monitored process [2023-12-16 06:55:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:55:02,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 06:55:02,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:55:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 916 proven. 210 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2023-12-16 06:55:02,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:55:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 0 proven. 1130 refuted. 0 times theorem prover too weak. 1094 trivial. 0 not checked. [2023-12-16 06:55:02,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:55:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866102720] [2023-12-16 06:55:02,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866102720] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:55:02,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:55:02,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-12-16 06:55:02,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448760330] [2023-12-16 06:55:02,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:55:02,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 06:55:02,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:55:02,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 06:55:02,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2023-12-16 06:55:02,709 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 06:55:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:55:03,572 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2023-12-16 06:55:03,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 06:55:03,572 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 157 [2023-12-16 06:55:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:55:03,573 INFO L225 Difference]: With dead ends: 155 [2023-12-16 06:55:03,574 INFO L226 Difference]: Without dead ends: 103 [2023-12-16 06:55:03,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=398, Invalid=862, Unknown=0, NotChecked=0, Total=1260 [2023-12-16 06:55:03,575 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 51 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 06:55:03,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 254 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 06:55:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-16 06:55:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-16 06:55:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 98 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:55:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2023-12-16 06:55:03,582 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 157 [2023-12-16 06:55:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:55:03,583 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2023-12-16 06:55:03,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 06:55:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2023-12-16 06:55:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-16 06:55:03,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:55:03,584 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:55:03,608 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 06:55:03,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 06:55:03,785 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:55:03,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:55:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1194352818, now seen corresponding path program 2 times [2023-12-16 06:55:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:55:03,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729110464] [2023-12-16 06:55:03,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:55:03,785 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 06:55:03,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:55:03,786 INFO L229 MonitoredProcess]: Starting monitored process 14 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 06:55:03,787 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 (14)] Waiting until timeout for monitored process [2023-12-16 06:55:04,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:55:04,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:55:04,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:55:04,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:55:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5716 backedges. 2490 proven. 1 refuted. 0 times theorem prover too weak. 3225 trivial. 0 not checked. [2023-12-16 06:55:04,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:55:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5716 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5715 trivial. 0 not checked. [2023-12-16 06:55:04,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:55:04,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729110464] [2023-12-16 06:55:04,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729110464] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:55:04,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:55:04,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 06:55:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412732261] [2023-12-16 06:55:04,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:55:04,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:55:04,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:55:04,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:55:04,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:55:04,548 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 06:55:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:55:04,587 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2023-12-16 06:55:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:55:04,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 229 [2023-12-16 06:55:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:55:04,588 INFO L225 Difference]: With dead ends: 180 [2023-12-16 06:55:04,588 INFO L226 Difference]: Without dead ends: 106 [2023-12-16 06:55:04,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:55:04,589 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:55:04,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:55:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-16 06:55:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-12-16 06:55:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.118811881188119) internal successors, (113), 101 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:55:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2023-12-16 06:55:04,613 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 229 [2023-12-16 06:55:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:55:04,613 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2023-12-16 06:55:04,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 06:55:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2023-12-16 06:55:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-16 06:55:04,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:55:04,614 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:55:04,640 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 (14)] Forceful destruction successful, exit code 0 [2023-12-16 06:55:04,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 06:55:04,828 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:55:04,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:55:04,829 INFO L85 PathProgramCache]: Analyzing trace with hash -618674649, now seen corresponding path program 3 times [2023-12-16 06:55:04,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:55:04,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790292528] [2023-12-16 06:55:04,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 06:55:04,830 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 06:55:04,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:55:04,832 INFO L229 MonitoredProcess]: Starting monitored process 15 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 06:55:04,832 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 (15)] Waiting until timeout for monitored process [2023-12-16 06:55:05,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 06:55:05,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:55:05,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 06:55:05,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:55:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5725 backedges. 2490 proven. 10 refuted. 0 times theorem prover too weak. 3225 trivial. 0 not checked. [2023-12-16 06:55:05,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:55:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5725 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5715 trivial. 0 not checked. [2023-12-16 06:55:05,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:55:05,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790292528] [2023-12-16 06:55:05,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790292528] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:55:05,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:55:05,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 06:55:05,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125960797] [2023-12-16 06:55:05,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:55:05,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:55:05,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:55:05,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:55:05,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:55:05,416 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 06:55:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:55:05,603 INFO L93 Difference]: Finished difference Result 186 states and 214 transitions. [2023-12-16 06:55:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:55:05,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 232 [2023-12-16 06:55:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:55:05,605 INFO L225 Difference]: With dead ends: 186 [2023-12-16 06:55:05,605 INFO L226 Difference]: Without dead ends: 112 [2023-12-16 06:55:05,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-16 06:55:05,606 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:55:05,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:55:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-16 06:55:05,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-12-16 06:55:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.1121495327102804) internal successors, (119), 107 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:55:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2023-12-16 06:55:05,613 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 232 [2023-12-16 06:55:05,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:55:05,613 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2023-12-16 06:55:05,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 06:55:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2023-12-16 06:55:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-16 06:55:05,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:55:05,616 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:55:05,646 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 (15)] Forceful destruction successful, exit code 0 [2023-12-16 06:55:05,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 06:55:05,828 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:55:05,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:55:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash 314336455, now seen corresponding path program 4 times [2023-12-16 06:55:05,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:55:05,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203956311] [2023-12-16 06:55:05,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 06:55:05,829 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 06:55:05,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:55:05,830 INFO L229 MonitoredProcess]: Starting monitored process 16 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 06:55:05,831 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 (16)] Waiting until timeout for monitored process [2023-12-16 06:55:06,716 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 06:55:06,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:55:06,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 06:55:06,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:55:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5770 backedges. 2490 proven. 55 refuted. 0 times theorem prover too weak. 3225 trivial. 0 not checked. [2023-12-16 06:55:06,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:55:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5770 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5715 trivial. 0 not checked. [2023-12-16 06:55:07,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:55:07,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203956311] [2023-12-16 06:55:07,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203956311] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:55:07,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:55:07,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-16 06:55:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257661097] [2023-12-16 06:55:07,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:55:07,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 06:55:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:55:07,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 06:55:07,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2023-12-16 06:55:07,202 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 06:55:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:55:07,777 INFO L93 Difference]: Finished difference Result 195 states and 226 transitions. [2023-12-16 06:55:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 06:55:07,777 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 238 [2023-12-16 06:55:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:55:07,778 INFO L225 Difference]: With dead ends: 195 [2023-12-16 06:55:07,778 INFO L226 Difference]: Without dead ends: 121 [2023-12-16 06:55:07,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=310, Invalid=620, Unknown=0, NotChecked=0, Total=930 [2023-12-16 06:55:07,779 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:55:07,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:55:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-16 06:55:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-12-16 06:55:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.103448275862069) internal successors, (128), 116 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 06:55:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2023-12-16 06:55:07,784 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 238 [2023-12-16 06:55:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:55:07,785 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2023-12-16 06:55:07,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 06:55:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2023-12-16 06:55:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-16 06:55:07,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:55:07,786 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:55:07,807 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 (16)] Forceful destruction successful, exit code 0 [2023-12-16 06:55:08,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 06:55:08,001 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:55:08,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:55:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash 487831406, now seen corresponding path program 5 times [2023-12-16 06:55:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:55:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934917139] [2023-12-16 06:55:08,001 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 06:55:08,002 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 06:55:08,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:55:08,003 INFO L229 MonitoredProcess]: Starting monitored process 17 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 06:55:08,037 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 (17)] Waiting until timeout for monitored process [2023-12-16 06:55:13,062 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2023-12-16 06:55:13,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 06:55:13,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 06:55:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 06:55:16,003 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 06:55:16,003 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 06:55:16,004 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 06:55:16,054 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 (17)] Forceful destruction successful, exit code 0 [2023-12-16 06:55:16,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 06:55:16,208 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 2, 1, 1] [2023-12-16 06:55:16,210 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 06:55:16,279 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-12-16 06:55:16,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:55:16 BoogieIcfgContainer [2023-12-16 06:55:16,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 06:55:16,340 INFO L158 Benchmark]: Toolchain (without parser) took 23218.13ms. Allocated memory was 206.6MB in the beginning and 291.5MB in the end (delta: 84.9MB). Free memory was 152.3MB in the beginning and 234.1MB in the end (delta: -81.8MB). Peak memory consumption was 4.1MB. Max. memory is 8.0GB. [2023-12-16 06:55:16,340 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 206.6MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:55:16,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.04ms. Allocated memory is still 206.6MB. Free memory was 151.8MB in the beginning and 140.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 06:55:16,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.66ms. Allocated memory is still 206.6MB. Free memory was 140.2MB in the beginning and 138.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 06:55:16,341 INFO L158 Benchmark]: Boogie Preprocessor took 26.09ms. Allocated memory is still 206.6MB. Free memory was 138.6MB in the beginning and 136.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 06:55:16,341 INFO L158 Benchmark]: RCFGBuilder took 607.09ms. Allocated memory is still 206.6MB. Free memory was 136.1MB in the beginning and 172.2MB in the end (delta: -36.1MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2023-12-16 06:55:16,341 INFO L158 Benchmark]: TraceAbstraction took 22385.32ms. Allocated memory was 206.6MB in the beginning and 291.5MB in the end (delta: 84.9MB). Free memory was 171.1MB in the beginning and 234.1MB in the end (delta: -62.9MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-16 06:55:16,344 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 206.6MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.04ms. Allocated memory is still 206.6MB. Free memory was 151.8MB in the beginning and 140.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.66ms. Allocated memory is still 206.6MB. Free memory was 140.2MB in the beginning and 138.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.09ms. Allocated memory is still 206.6MB. Free memory was 138.6MB in the beginning and 136.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 607.09ms. Allocated memory is still 206.6MB. Free memory was 136.1MB in the beginning and 172.2MB in the end (delta: -36.1MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * TraceAbstraction took 22385.32ms. Allocated memory was 206.6MB in the beginning and 291.5MB in the end (delta: 84.9MB). Free memory was 171.1MB in the beginning and 234.1MB in the end (delta: -62.9MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[20]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={-2147483648:0}, x={-2147483648:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={-2147483648:0}, x={-2147483648:0}] [L17] COND FALSE !(i < 20) VAL [i=20, x={-2147483648:0}, x={-2147483648:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={-2147483648:0}] [L49] CALL, EXPR rangesum(x) VAL [x={-2147483648:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=3, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=4, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=5, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=6, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=7, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=8, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=9, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=0, cnt=9, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L49] RET, EXPR rangesum(x) VAL [x={-2147483648:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [x={-2147483648:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=3, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=4, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=5, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=6, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=7, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=8, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=9, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=0, cnt=9, i=20, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L52] RET, EXPR rangesum(x) VAL [ret=0, temp=0, x={-2147483648:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L54] COND FALSE !(i<20 -1) VAL [i=19, ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L57] x[20 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [x={-2147483648:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=1, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=2, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=3, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=4, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=5, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=6, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=7, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=8, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=0, x={-2147483648:0}, x={-2147483648:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L28] i++ VAL [cnt=9, i=20, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-238609294, cnt=9, i=20, ret=-2147483648, x={-2147483648:0}, x={-2147483648:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=0, ret=0, temp=-2147483648, x={-2147483648:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [ret2=0, ret5=-238609294, ret=0, temp=-2147483648, x={-2147483648:0}] [L61] reach_error() VAL [ret2=0, ret5=-238609294, ret=0, temp=-2147483648, x={-2147483648:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 16, TraceHistogramMax: 60, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 1844 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1502 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1350 IncrementalHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 342 mSDtfsCounter, 1350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2756 GetRequests, 2591 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=15, InterpolantAutomatonStates: 144, 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, 15 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 8.9s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1763 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2716 ConstructedInterpolants, 0 QuantifiedInterpolants, 3366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2670 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 42568/44770 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-16 06:55:16,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...