/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/nla-digbench-scaling/egcd3-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:58:54,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:58:54,582 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-25 01:58:54,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:58:54,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:58:54,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:58:54,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:58:54,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:58:54,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:58:54,611 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:58:54,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:58:54,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:58:54,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:58:54,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:58:54,612 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:58:54,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:58:54,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:58:54,613 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:58:54,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:58:54,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:58:54,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:58:54,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:58:54,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:58:54,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:58:54,619 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:58:54,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:58:54,620 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:58:54,620 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:58:54,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:58:54,620 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:58:54,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:58:54,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:58:54,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:58:54,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:58:54,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:58:54,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:58:54,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:58:54,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:58:54,622 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:58:54,622 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:58:54,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:58:54,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:58:54,623 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:58:54,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:58:54,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:58:54,623 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:58:54,623 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-25 01:58:54,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:58:54,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:58:54,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:58:54,824 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:58:54,824 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:58:54,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound1.c [2023-12-25 01:58:55,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:58:55,846 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:58:55,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound1.c [2023-12-25 01:58:55,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/002fb241a/4831fb435e024d58975cb425ff338ac0/FLAG4f883b721 [2023-12-25 01:58:55,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/002fb241a/4831fb435e024d58975cb425ff338ac0 [2023-12-25 01:58:55,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:58:55,869 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:58:55,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:58:55,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:58:55,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:58:55,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8a8e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:55, skipping insertion in model container [2023-12-25 01:58:55,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:58:55" (1/1) ... [2023-12-25 01:58:55,893 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:58:56,028 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound1.c[490,503] [2023-12-25 01:58:56,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:58:56,083 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:58:56,096 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound1.c[490,503] [2023-12-25 01:58:56,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:58:56,119 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:58:56,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56 WrapperNode [2023-12-25 01:58:56,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:58:56,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:58:56,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:58:56,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:58:56,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,154 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-12-25 01:58:56,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:58:56,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:58:56,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:58:56,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:58:56,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,179 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 01:58:56,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:58:56,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:58:56,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:58:56,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:58:56,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (1/1) ... [2023-12-25 01:58:56,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:58:56,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:58:56,218 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-25 01:58:56,229 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-25 01:58:56,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:58:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:58:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:58:56,251 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:58:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:58:56,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:58:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:58:56,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:58:56,305 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:58:56,306 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:58:56,609 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:58:56,641 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:58:56,641 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-25 01:58:56,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:58:56 BoogieIcfgContainer [2023-12-25 01:58:56,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:58:56,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:58:56,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:58:56,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:58:56,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:58:55" (1/3) ... [2023-12-25 01:58:56,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad04c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:58:56, skipping insertion in model container [2023-12-25 01:58:56,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:58:56" (2/3) ... [2023-12-25 01:58:56,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad04c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:58:56, skipping insertion in model container [2023-12-25 01:58:56,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:58:56" (3/3) ... [2023-12-25 01:58:56,647 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound1.c [2023-12-25 01:58:56,658 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:58:56,659 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:58:56,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:58:56,701 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;@55560c9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:58:56,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:58:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 01:58:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 01:58:56,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:58:56,711 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:58:56,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:58:56,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:58:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash 67099435, now seen corresponding path program 1 times [2023-12-25 01:58:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:58:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133983414] [2023-12-25 01:58:56,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:58:56,726 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-25 01:58:56,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:58:56,728 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-25 01:58:56,751 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-25 01:58:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:58:56,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:58:56,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:58:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:58:56,889 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:58:56,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:58:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133983414] [2023-12-25 01:58:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133983414] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:58:56,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:58:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:58:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331131693] [2023-12-25 01:58:56,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:58:56,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:58:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:58:56,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:58:56,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:58:56,911 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 01:58:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:58:56,930 INFO L93 Difference]: Finished difference Result 62 states and 104 transitions. [2023-12-25 01:58:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:58:56,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-25 01:58:56,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:58:56,936 INFO L225 Difference]: With dead ends: 62 [2023-12-25 01:58:56,936 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 01:58:56,938 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-25 01:58:56,940 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:58:56,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:58:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 01:58:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-25 01:58:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:58:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-12-25 01:58:56,979 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 28 [2023-12-25 01:58:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:58:56,980 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-12-25 01:58:56,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 01:58:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-12-25 01:58:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 01:58:56,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:58:56,982 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:58:56,991 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-25 01:58:57,188 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-25 01:58:57,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:58:57,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:58:57,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1772608446, now seen corresponding path program 1 times [2023-12-25 01:58:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:58:57,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065553582] [2023-12-25 01:58:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:58:57,190 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-25 01:58:57,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:58:57,191 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-25 01:58:57,199 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-25 01:58:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:58:57,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 01:58:57,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:58:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:58:57,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:58:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 01:58:57,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:58:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065553582] [2023-12-25 01:58:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065553582] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:58:57,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:58:57,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2023-12-25 01:58:57,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447218299] [2023-12-25 01:58:57,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:58:57,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 01:58:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:58:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 01:58:57,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:58:57,689 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 01:58:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:58:58,132 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-12-25 01:58:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:58:58,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2023-12-25 01:58:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:58:58,137 INFO L225 Difference]: With dead ends: 39 [2023-12-25 01:58:58,137 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 01:58:58,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 01:58:58,139 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:58:58,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 01:58:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 01:58:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-25 01:58:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:58:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-25 01:58:58,144 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 29 [2023-12-25 01:58:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:58:58,145 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-25 01:58:58,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 01:58:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-25 01:58:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 01:58:58,146 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:58:58,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:58:58,155 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-25 01:58:58,353 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-25 01:58:58,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:58:58,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:58:58,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1072684582, now seen corresponding path program 1 times [2023-12-25 01:58:58,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:58:58,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143389153] [2023-12-25 01:58:58,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:58:58,354 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-25 01:58:58,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:58:58,355 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-25 01:58:58,357 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-25 01:58:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:58:58,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:58:58,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:58:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 01:58:58,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:59:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:59:02,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:59:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143389153] [2023-12-25 01:59:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143389153] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:59:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:59:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-25 01:59:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617917529] [2023-12-25 01:59:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:59:02,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:59:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:59:02,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:59:02,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:59:02,658 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 01:59:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:59:06,755 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-12-25 01:59:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:59:06,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-12-25 01:59:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:59:06,783 INFO L225 Difference]: With dead ends: 48 [2023-12-25 01:59:06,783 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 01:59:06,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:59:06,784 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:59:06,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-25 01:59:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 01:59:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-12-25 01:59:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 01:59:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2023-12-25 01:59:06,802 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 32 [2023-12-25 01:59:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:59:06,803 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2023-12-25 01:59:06,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 01:59:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2023-12-25 01:59:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 01:59:06,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:59:06,804 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:59:06,814 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-25 01:59:07,010 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-25 01:59:07,013 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:59:07,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:59:07,014 INFO L85 PathProgramCache]: Analyzing trace with hash 581538888, now seen corresponding path program 1 times [2023-12-25 01:59:07,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:59:07,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127358707] [2023-12-25 01:59:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:59:07,014 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-25 01:59:07,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:59:07,015 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-25 01:59:07,016 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-25 01:59:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:59:07,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 01:59:07,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:59:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:59:08,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:59:08,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:59:08,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127358707] [2023-12-25 01:59:08,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127358707] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:59:08,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:59:08,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 01:59:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930010033] [2023-12-25 01:59:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:59:08,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 01:59:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:59:08,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 01:59:08,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:59:08,054 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:59:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:59:09,635 INFO L93 Difference]: Finished difference Result 74 states and 100 transitions. [2023-12-25 01:59:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 01:59:09,635 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2023-12-25 01:59:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:59:09,636 INFO L225 Difference]: With dead ends: 74 [2023-12-25 01:59:09,636 INFO L226 Difference]: Without dead ends: 55 [2023-12-25 01:59:09,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:59:09,637 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 76 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:59:09,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 143 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 01:59:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-25 01:59:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2023-12-25 01:59:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 01:59:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2023-12-25 01:59:09,651 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 34 [2023-12-25 01:59:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:59:09,651 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2023-12-25 01:59:09,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:59:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2023-12-25 01:59:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 01:59:09,652 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:59:09,652 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:59:09,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 01:59:09,864 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-25 01:59:09,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:59:09,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:59:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1534715754, now seen corresponding path program 1 times [2023-12-25 01:59:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:59:09,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439733298] [2023-12-25 01:59:09,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:59:09,866 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-25 01:59:09,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:59:09,866 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-25 01:59:09,867 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-25 01:59:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:59:09,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:59:09,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:59:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 01:59:10,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:59:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:59:16,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:59:16,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439733298] [2023-12-25 01:59:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439733298] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:59:16,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:59:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-25 01:59:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904930225] [2023-12-25 01:59:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:59:16,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:59:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:59:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:59:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:59:16,549 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 01:59:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:59:22,633 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2023-12-25 01:59:22,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:59:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-12-25 01:59:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:59:22,649 INFO L225 Difference]: With dead ends: 54 [2023-12-25 01:59:22,649 INFO L226 Difference]: Without dead ends: 52 [2023-12-25 01:59:22,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:59:22,650 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:59:22,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-25 01:59:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-25 01:59:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-12-25 01:59:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 01:59:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2023-12-25 01:59:22,662 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 37 [2023-12-25 01:59:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:59:22,662 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2023-12-25 01:59:22,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 01:59:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2023-12-25 01:59:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 01:59:22,663 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:59:22,663 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:59:22,670 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-25 01:59:22,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:59:22,870 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:59:22,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:59:22,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1246105370, now seen corresponding path program 1 times [2023-12-25 01:59:22,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:59:22,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239615871] [2023-12-25 01:59:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:59:22,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:59:22,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:59:22,872 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:59:22,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 01:59:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:59:23,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 01:59:23,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:59:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 01:59:24,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:59:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 01:59:28,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:59:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239615871] [2023-12-25 01:59:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239615871] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:59:28,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:59:28,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2023-12-25 01:59:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107149080] [2023-12-25 01:59:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:59:28,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:59:28,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:59:28,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:59:28,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:59:28,112 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:59:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:59:32,583 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2023-12-25 01:59:32,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:59:32,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2023-12-25 01:59:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:59:32,594 INFO L225 Difference]: With dead ends: 74 [2023-12-25 01:59:32,594 INFO L226 Difference]: Without dead ends: 72 [2023-12-25 01:59:32,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:59:32,595 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:59:32,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 120 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-25 01:59:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-25 01:59:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2023-12-25 01:59:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 43 states have internal predecessors, (51), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-25 01:59:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2023-12-25 01:59:32,609 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 42 [2023-12-25 01:59:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:59:32,609 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2023-12-25 01:59:32,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:59:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2023-12-25 01:59:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 01:59:32,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:59:32,610 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:59:32,618 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-25 01:59:32,811 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-25 01:59:32,811 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:59:32,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:59:32,812 INFO L85 PathProgramCache]: Analyzing trace with hash 225223382, now seen corresponding path program 1 times [2023-12-25 01:59:32,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:59:32,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87983093] [2023-12-25 01:59:32,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:59:32,812 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-25 01:59:32,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:59:32,814 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-25 01:59:32,815 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-25 01:59:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:59:32,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:59:32,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:59:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:59:33,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:59:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 01:59:36,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:59:36,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87983093] [2023-12-25 01:59:36,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87983093] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:59:36,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:59:36,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-25 01:59:36,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414567368] [2023-12-25 01:59:36,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:59:36,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:59:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:59:36,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:59:36,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:59:36,624 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 01:59:42,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:59:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:59:44,851 INFO L93 Difference]: Finished difference Result 101 states and 143 transitions. [2023-12-25 01:59:44,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:59:44,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2023-12-25 01:59:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:59:44,863 INFO L225 Difference]: With dead ends: 101 [2023-12-25 01:59:44,863 INFO L226 Difference]: Without dead ends: 99 [2023-12-25 01:59:44,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:59:44,867 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:59:44,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2023-12-25 01:59:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-25 01:59:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2023-12-25 01:59:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 49 states have (on average 1.183673469387755) internal successors, (58), 54 states have internal predecessors, (58), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-25 01:59:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2023-12-25 01:59:44,891 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 47 [2023-12-25 01:59:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:59:44,892 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2023-12-25 01:59:44,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 01:59:44,892 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2023-12-25 01:59:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 01:59:44,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:59:44,895 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:59:44,908 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-25 01:59:45,106 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-25 01:59:45,107 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:59:45,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:59:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash 371933676, now seen corresponding path program 1 times [2023-12-25 01:59:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:59:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569590942] [2023-12-25 01:59:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:59:45,108 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-25 01:59:45,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:59:45,109 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-25 01:59:45,113 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-25 01:59:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:59:45,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 01:59:45,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:59:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-25 01:59:48,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:00:38,293 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:02:08,642 WARN L293 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:02:16,042 WARN L293 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:02:27,091 WARN L293 SmtUtils]: Spent 6.79s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:02:35,319 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:02:42,532 WARN L293 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:03:45,233 WARN L293 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:05:45,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:05:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569590942] [2023-12-25 02:05:45,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569590942] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 02:05:45,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [282665016] [2023-12-25 02:05:45,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:05:45,386 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 02:05:45,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 02:05:45,458 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 02:05:45,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-25 02:05:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:05:46,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 02:05:46,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:05:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-25 02:05:57,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:07:47,642 WARN L293 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:07:55,338 WARN L293 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:02,475 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:09:09,780 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:16,428 WARN L293 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:30,178 WARN L293 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:37,145 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) |c_ULTIMATE.start_main_~c~0#1|))) (= |c_ULTIMATE.start_main_~b~0#1| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvneg (bvmul .cse0 (bvadd |c_ULTIMATE.start_main_~r~0#1| (bvneg (bvmul .cse1 |c_ULTIMATE.start_main_~s~0#1|))))) (bvneg (bvmul (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse1)) |c_ULTIMATE.start_main_~p~0#1|) .cse2)) (bvmul .cse0 |c_ULTIMATE.start_main_~s~0#1|) (bvmul |c_ULTIMATE.start_main_~q~0#1| .cse2)))) (bvsge (_ bv0 64) |c_ULTIMATE.start_main_~b~0#1|)) is different from true [2023-12-25 02:09:44,412 WARN L293 SmtUtils]: Spent 7.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:09:56,634 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:10,283 WARN L293 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:20,048 WARN L293 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:26,733 WARN L293 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:33,100 WARN L293 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:54,178 WARN L293 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:10:59,236 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:11:07,569 WARN L293 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:12:32,918 WARN L293 SmtUtils]: Spent 9.68s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:13:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-25 02:13:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [282665016] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:13:30,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 02:13:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 30 [2023-12-25 02:13:30,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860116100] [2023-12-25 02:13:30,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 02:13:30,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-25 02:13:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:13:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-25 02:13:30,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1154, Unknown=25, NotChecked=72, Total=1482 [2023-12-25 02:13:30,298 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 30 states, 27 states have (on average 2.074074074074074) internal successors, (56), 25 states have internal predecessors, (56), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2023-12-25 02:13:32,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 02:13:36,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 02:13:37,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 02:13:40,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-25 02:13:43,103 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:13:43,104 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:13:43,104 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:13:43,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:13:44,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-25 02:13:44,127 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-25 02:13:44,306 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 02:13:44,333 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 137 [2023-12-25 02:13:44,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 583.7s TimeCoverageRelationStatistics Valid=231, Invalid=1154, Unknown=25, NotChecked=72, Total=1482 [2023-12-25 02:13:44,334 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2023-12-25 02:13:44,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 3 Unchecked, 13.3s Time] [2023-12-25 02:13:44,335 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 02:13:44,335 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 02:13:44,338 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:13:44,340 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 02:13:44,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 02:13:44 BoogieIcfgContainer [2023-12-25 02:13:44,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 02:13:44,341 INFO L158 Benchmark]: Toolchain (without parser) took 888472.50ms. Allocated memory is still 234.9MB. Free memory was 185.6MB in the beginning and 140.9MB in the end (delta: 44.7MB). Peak memory consumption was 46.3MB. Max. memory is 8.0GB. [2023-12-25 02:13:44,341 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 184.5MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:13:44,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.48ms. Allocated memory is still 234.9MB. Free memory was 185.3MB in the beginning and 173.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 02:13:44,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.42ms. Allocated memory is still 234.9MB. Free memory was 173.4MB in the beginning and 171.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:13:44,342 INFO L158 Benchmark]: Boogie Preprocessor took 40.73ms. Allocated memory is still 234.9MB. Free memory was 171.6MB in the beginning and 169.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:13:44,342 INFO L158 Benchmark]: RCFGBuilder took 445.74ms. Allocated memory is still 234.9MB. Free memory was 169.5MB in the beginning and 155.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 02:13:44,342 INFO L158 Benchmark]: TraceAbstraction took 887697.80ms. Allocated memory is still 234.9MB. Free memory was 155.2MB in the beginning and 140.9MB in the end (delta: 14.4MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2023-12-25 02:13:44,343 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.40ms. Allocated memory is still 184.5MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.48ms. Allocated memory is still 234.9MB. Free memory was 185.3MB in the beginning and 173.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.42ms. Allocated memory is still 234.9MB. Free memory was 173.4MB in the beginning and 171.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.73ms. Allocated memory is still 234.9MB. Free memory was 171.6MB in the beginning and 169.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 445.74ms. Allocated memory is still 234.9MB. Free memory was 169.5MB in the beginning and 155.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 887697.80ms. Allocated memory is still 234.9MB. Free memory was 155.2MB in the beginning and 140.9MB in the end (delta: 14.4MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 887.7s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 39.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 37.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 778 SdHoareTripleChecker+Invalid, 35.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 301 IncrementalHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 230 mSDtfsCounter, 301 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 547 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 595.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, InterpolantAutomatonStates: 42, 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, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 844.9s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 598 ConstructedInterpolants, 23 QuantifiedInterpolants, 3959 SizeOfPredicates, 42 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 475/526 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown