/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/prodbin-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:39:41,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:39:41,099 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 04:39:41,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:39:41,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:39:41,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:39:41,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:39:41,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:39:41,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:39:41,124 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:39:41,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:39:41,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:39:41,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:39:41,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:39:41,126 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:39:41,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:39:41,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:39:41,127 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:39:41,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:39:41,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:39:41,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:39:41,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:39:41,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:39:41,131 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:39:41,131 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:39:41,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:39:41,132 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:39:41,132 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:39:41,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:39:41,133 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:39:41,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:39:41,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:39:41,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:39:41,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:39:41,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:39:41,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:39:41,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:39:41,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:39:41,136 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:39:41,136 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:39:41,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:39:41,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:39:41,140 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:39:41,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:39:41,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:39:41,141 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:39:41,141 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 04:39:41,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:39:41,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:39:41,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:39:41,335 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:39:41,335 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:39:41,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound20.c [2023-12-25 04:39:42,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:39:42,712 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:39:42,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound20.c [2023-12-25 04:39:42,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68e8fb2a/50040c858ebf450385f8dd24c5cf12cb/FLAG345c5307d [2023-12-25 04:39:42,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68e8fb2a/50040c858ebf450385f8dd24c5cf12cb [2023-12-25 04:39:42,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:39:42,738 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:39:42,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:39:42,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:39:42,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:39:42,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:42,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d80ce9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42, skipping insertion in model container [2023-12-25 04:39:42,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:42,764 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:39:42,907 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/prodbin-ll_valuebound20.c[537,550] [2023-12-25 04:39:42,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:39:42,927 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:39:42,937 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/prodbin-ll_valuebound20.c[537,550] [2023-12-25 04:39:42,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:39:42,953 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:39:42,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42 WrapperNode [2023-12-25 04:39:42,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:39:42,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:39:42,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:39:42,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:39:42,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:42,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:42,981 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2023-12-25 04:39:42,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:39:42,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:39:42,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:39:42,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:39:42,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:42,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:42,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:43,002 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 04:39:43,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:43,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:43,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:43,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:43,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:43,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:43,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:39:43,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:39:43,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:39:43,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:39:43,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (1/1) ... [2023-12-25 04:39:43,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:39:43,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:39:43,061 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 04:39:43,066 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 04:39:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:39:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:39:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:39:43,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:39:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:39:43,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:39:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:39:43,092 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:39:43,162 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:39:43,166 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:39:43,421 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:39:43,439 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:39:43,440 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:39:43,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:39:43 BoogieIcfgContainer [2023-12-25 04:39:43,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:39:43,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:39:43,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:39:43,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:39:43,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:39:42" (1/3) ... [2023-12-25 04:39:43,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebb7521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:39:43, skipping insertion in model container [2023-12-25 04:39:43,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:39:42" (2/3) ... [2023-12-25 04:39:43,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebb7521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:39:43, skipping insertion in model container [2023-12-25 04:39:43,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:39:43" (3/3) ... [2023-12-25 04:39:43,447 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound20.c [2023-12-25 04:39:43,464 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:39:43,464 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:39:43,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:39:43,505 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;@59a6ad51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:39:43,505 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:39:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:39:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:39:43,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:39:43,521 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:39:43,522 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:39:43,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:39:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1698673820, now seen corresponding path program 1 times [2023-12-25 04:39:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:39:43,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144937600] [2023-12-25 04:39:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:39:43,541 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 04:39:43,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:39:43,555 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 04:39:43,559 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 04:39:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:39:43,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:39:43,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:39:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 04:39:43,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:39:43,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:39:43,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144937600] [2023-12-25 04:39:43,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144937600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:39:43,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:39:43,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:39:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652302242] [2023-12-25 04:39:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:39:43,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:39:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:39:43,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:39:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:39:43,756 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:39:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:39:43,781 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-12-25 04:39:43,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:39:43,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 04:39:43,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:39:43,793 INFO L225 Difference]: With dead ends: 46 [2023-12-25 04:39:43,794 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 04:39:43,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 04:39:43,799 INFO L413 NwaCegarLoop]: 26 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, 26 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 04:39:43,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:39:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 04:39:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-25 04:39:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:39:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-25 04:39:43,830 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 23 [2023-12-25 04:39:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:39:43,831 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-25 04:39:43,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:39:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-25 04:39:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:39:43,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:39:43,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:39:43,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 04:39:44,036 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 04:39:44,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:39:44,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:39:44,037 INFO L85 PathProgramCache]: Analyzing trace with hash 549966490, now seen corresponding path program 1 times [2023-12-25 04:39:44,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:39:44,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902816248] [2023-12-25 04:39:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:39:44,038 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 04:39:44,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:39:44,044 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 04:39:44,048 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 04:39:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:39:44,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 04:39:44,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:39:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:39:44,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:39:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:39:48,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:39:48,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902816248] [2023-12-25 04:39:48,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902816248] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:39:48,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:39:48,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 04:39:48,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633669814] [2023-12-25 04:39:48,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:39:48,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:39:48,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:39:48,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:39:48,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 04:39:48,008 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 04:39:53,532 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 04:39:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:39:55,605 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-12-25 04:39:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 04:39:55,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-25 04:39:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:39:55,623 INFO L225 Difference]: With dead ends: 34 [2023-12-25 04:39:55,623 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 04:39:55,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 04:39:55,625 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-25 04:39:55,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 67 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2023-12-25 04:39:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 04:39:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-12-25 04:39:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:39:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-12-25 04:39:55,633 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2023-12-25 04:39:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:39:55,634 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-12-25 04:39:55,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 04:39:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-12-25 04:39:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 04:39:55,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:39:55,636 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:39:55,642 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 04:39:55,841 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 04:39:55,842 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:39:55,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:39:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1559575677, now seen corresponding path program 1 times [2023-12-25 04:39:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:39:55,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442573022] [2023-12-25 04:39:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:39:55,843 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 04:39:55,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:39:55,847 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 04:39:55,849 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 04:39:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:39:55,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 04:39:55,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:39:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:39:56,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:39:56,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:39:56,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442573022] [2023-12-25 04:39:56,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442573022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:39:56,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:39:56,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 04:39:56,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390472391] [2023-12-25 04:39:56,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:39:56,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 04:39:56,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:39:56,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 04:39:56,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 04:39:56,221 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 04:39:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:39:56,793 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-12-25 04:39:56,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 04:39:56,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-12-25 04:39:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:39:56,795 INFO L225 Difference]: With dead ends: 38 [2023-12-25 04:39:56,795 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 04:39:56,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 04:39:56,796 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:39:56,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 04:39:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 04:39:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-25 04:39:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:39:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-12-25 04:39:56,803 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 29 [2023-12-25 04:39:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:39:56,804 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-12-25 04:39:56,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 04:39:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-12-25 04:39:56,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 04:39:56,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:39:56,809 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:39:56,817 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 04:39:57,009 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 04:39:57,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:39:57,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:39:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash 191228685, now seen corresponding path program 1 times [2023-12-25 04:39:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:39:57,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621498811] [2023-12-25 04:39:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:39:57,012 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 04:39:57,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:39:57,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 04:39:57,020 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 04:39:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:39:57,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 04:39:57,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:40:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:40:06,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:40:56,766 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64))) (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvmul .cse1 .cse0) (bvadd .cse1 (bvmul (bvmul .cse1 (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse0) (_ bv2 64))) (_ bv2 64))))))) is different from true [2023-12-25 04:41:13,457 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:41:30,126 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (or (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv20 32))) (not (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64))) (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvadd .cse1 (bvmul (bvmul .cse1 (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse0) (_ bv2 64))) (_ bv2 64))) (bvmul .cse1 .cse0)))))) is different from true [2023-12-25 04:41:30,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:41:30,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621498811] [2023-12-25 04:41:30,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621498811] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:41:30,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [873947411] [2023-12-25 04:41:30,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:41:30,128 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 04:41:30,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 04:41:30,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 04:41:30,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-25 04:41:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:41:30,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:41:30,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:41:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:41:34,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:41:58,423 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (not (= .cse0 (bvadd (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) |c_ULTIMATE.start_main_~z~0#1|))) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (= .cse0 (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1| (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64))) (_ bv2 64)))))) is different from true [2023-12-25 04:42:38,971 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:42:51,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [873947411] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:42:51,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:42:51,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2023-12-25 04:42:51,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381941336] [2023-12-25 04:42:51,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:42:51,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 04:42:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:42:51,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 04:42:51,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=256, Unknown=4, NotChecked=102, Total=420 [2023-12-25 04:42:51,618 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-25 04:42:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:42:58,430 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2023-12-25 04:42:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 04:42:58,482 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 32 [2023-12-25 04:42:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:42:58,483 INFO L225 Difference]: With dead ends: 44 [2023-12-25 04:42:58,483 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 04:42:58,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 51.4s TimeCoverageRelationStatistics Valid=77, Invalid=351, Unknown=4, NotChecked=120, Total=552 [2023-12-25 04:42:58,485 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:42:58,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 83 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-25 04:42:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 04:42:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2023-12-25 04:42:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:42:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-12-25 04:42:58,494 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 32 [2023-12-25 04:42:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:42:58,494 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-12-25 04:42:58,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-25 04:42:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-12-25 04:42:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 04:42:58,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:42:58,495 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:42:58,501 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 04:42:58,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-25 04:42:58,899 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 04:42:58,900 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:42:58,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:42:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1966236047, now seen corresponding path program 1 times [2023-12-25 04:42:58,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:42:58,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134722660] [2023-12-25 04:42:58,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:42:58,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:42:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:42:58,902 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 04:42:58,904 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 04:42:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:42:59,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 04:42:59,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:43:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:43:09,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:44:22,226 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:44:39,563 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (or (not (bvsge |c_ULTIMATE.start_main_~b~0#1| (_ bv1 32))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvmul .cse0 .cse1) (bvmul (_ bv2 64) (bvmul .cse0 (bvsdiv .cse1 (_ bv2 64)))))) (= (bvsrem .cse1 (_ bv2 64)) (_ bv1 64)))) is different from true [2023-12-25 04:44:54,108 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:45:38,813 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_23| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_20|))) (or (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_23|))) (= (bvmul .cse0 .cse1) (bvmul (_ bv2 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) .cse1)))) (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64)) (bvsle |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_20| (_ bv20 32))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:46:16,633 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_23| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_20|))) (or (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_23|))) (= (bvmul .cse0 .cse1) (bvmul (_ bv2 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) .cse1)))) (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64)) (bvsle |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_20| (_ bv20 32))))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:46:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-12-25 04:46:16,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:46:16,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134722660] [2023-12-25 04:46:16,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134722660] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:46:16,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:46:16,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2023-12-25 04:46:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533170780] [2023-12-25 04:46:16,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:46:16,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 04:46:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:46:16,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 04:46:16,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=311, Unknown=3, NotChecked=114, Total=506 [2023-12-25 04:46:16,703 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 23 states, 21 states have (on average 1.619047619047619) internal successors, (34), 17 states have internal predecessors, (34), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 04:46:20,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 04:46:22,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 04:46:31,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:46:42,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:46:57,656 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:47:12,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:47:18,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:47:22,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:47:26,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:47:30,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:47:58,982 WARN L293 SmtUtils]: Spent 13.23s 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 04:48:15,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:48:19,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:48:23,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:48:27,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:48:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:48:27,111 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2023-12-25 04:48:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 04:48:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.619047619047619) internal successors, (34), 17 states have internal predecessors, (34), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 32 [2023-12-25 04:48:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:48:27,186 INFO L225 Difference]: With dead ends: 65 [2023-12-25 04:48:27,186 INFO L226 Difference]: Without dead ends: 58 [2023-12-25 04:48:27,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 144.2s TimeCoverageRelationStatistics Valid=152, Invalid=559, Unknown=3, NotChecked=156, Total=870 [2023-12-25 04:48:27,187 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 55 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 22 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 63.9s IncrementalHoareTripleChecker+Time [2023-12-25 04:48:27,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 153 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 256 Invalid, 9 Unknown, 176 Unchecked, 63.9s Time] [2023-12-25 04:48:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-25 04:48:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2023-12-25 04:48:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 04:48:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2023-12-25 04:48:27,200 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 32 [2023-12-25 04:48:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:48:27,200 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2023-12-25 04:48:27,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.619047619047619) internal successors, (34), 17 states have internal predecessors, (34), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 04:48:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2023-12-25 04:48:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 04:48:27,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:48:27,202 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:48:27,211 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 04:48:27,409 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 04:48:27,409 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:48:27,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:48:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1307708752, now seen corresponding path program 1 times [2023-12-25 04:48:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:48:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914293292] [2023-12-25 04:48:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:48:27,410 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 04:48:27,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:48:27,412 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 04:48:27,413 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 04:48:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:48:27,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:48:27,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:48:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 04:48:43,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:48:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 04:48:50,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:48:50,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914293292] [2023-12-25 04:48:50,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914293292] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:48:50,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:48:50,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 19 [2023-12-25 04:48:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355663411] [2023-12-25 04:48:50,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:48:50,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 04:48:50,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:48:50,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 04:48:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-12-25 04:48:50,197 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 04:49:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:49:01,851 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2023-12-25 04:49:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 04:49:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2023-12-25 04:49:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:49:01,861 INFO L225 Difference]: With dead ends: 66 [2023-12-25 04:49:01,861 INFO L226 Difference]: Without dead ends: 58 [2023-12-25 04:49:01,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2023-12-25 04:49:01,862 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:49:01,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 110 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-12-25 04:49:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-25 04:49:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2023-12-25 04:49:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 04:49:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2023-12-25 04:49:01,873 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 38 [2023-12-25 04:49:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:49:01,873 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2023-12-25 04:49:01,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 04:49:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2023-12-25 04:49:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 04:49:01,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:49:01,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:49:01,881 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 04:49:02,077 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 04:49:02,078 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:49:02,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:49:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash -769612806, now seen corresponding path program 2 times [2023-12-25 04:49:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:49:02,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544246915] [2023-12-25 04:49:02,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 04:49:02,079 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 04:49:02,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:49:02,080 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 04:49:02,081 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 04:49:02,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 04:49:02,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:49:02,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 04:49:02,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:49:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 04:49:31,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:50:43,173 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (not (= .cse0 (bvadd (bvmul |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) |c_ULTIMATE.start_main_~z~0#1|))) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (= .cse0 (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1| (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64))) (_ bv2 64)))))) is different from true [2023-12-25 04:50:59,841 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:51:05,585 WARN L293 SmtUtils]: Spent 5.74s 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 04:51:15,513 WARN L293 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:51:20,947 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (.cse1 (bvsdiv |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (or (not (= .cse0 (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1) (_ bv2 64))))) (= .cse0 (bvadd (bvmul (bvmul (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse1) (_ bv2 64)) |c_ULTIMATE.start_main_~x~0#1|) (_ bv4 64)) (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|) |c_ULTIMATE.start_main_~z~0#1|)) (not (= (bvsrem .cse1 (_ bv2 64)) (_ bv1 64))))) is different from true [2023-12-25 04:51:26,189 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:51:31,324 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:51:39,666 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:51:48,020 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:51:53,190 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) (let ((.cse0 (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse1) (_ bv2 64)))) (or (not (= (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)) (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1| .cse0))) (not (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (= (bvadd (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|) (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse1) (_ bv2 64))) (_ bv4 64))) .cse0)))) is different from true [2023-12-25 04:52:10,859 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:52:19,251 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:52:29,804 WARN L293 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:52:38,159 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:52:46,506 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:52:51,524 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:53:04,707 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:53:13,063 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:53:35,132 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:53:39,683 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse0 (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse2) (_ bv2 64)))) (let ((.cse3 (bvmul (bvmul .cse1 .cse0) (_ bv2 64)))) (or (not (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64))) (not (= (bvmul .cse1 .cse2) (bvadd .cse1 .cse3))) (= (bvadd (bvmul (bvmul .cse1 (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64))) (_ bv4 64)) (bvmul .cse1 (_ bv2 64))) .cse3))))) is different from true [2023-12-25 04:53:57,594 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:54:10,630 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-25 04:54:25,195 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 04:54:25,195 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 04:54:26,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-25 04:54:26,397 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 04:54:26,429 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 04:54:26,431 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:54:26,432 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-25 04:54:26,435 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-12-25 04:54:26,438 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:54:26,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:54:26 BoogieIcfgContainer [2023-12-25 04:54:26,439 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:54:26,440 INFO L158 Benchmark]: Toolchain (without parser) took 883701.66ms. Allocated memory is still 343.9MB. Free memory was 294.5MB in the beginning and 163.4MB in the end (delta: 131.1MB). Peak memory consumption was 132.3MB. Max. memory is 8.0GB. [2023-12-25 04:54:26,440 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 198.2MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:54:26,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.43ms. Allocated memory is still 343.9MB. Free memory was 294.5MB in the beginning and 283.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 04:54:26,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.64ms. Allocated memory is still 343.9MB. Free memory was 283.1MB in the beginning and 281.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:54:26,440 INFO L158 Benchmark]: Boogie Preprocessor took 36.39ms. Allocated memory is still 343.9MB. Free memory was 281.5MB in the beginning and 279.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:54:26,441 INFO L158 Benchmark]: RCFGBuilder took 420.92ms. Allocated memory is still 343.9MB. Free memory was 279.7MB in the beginning and 267.9MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 04:54:26,441 INFO L158 Benchmark]: TraceAbstraction took 882997.32ms. Allocated memory is still 343.9MB. Free memory was 267.1MB in the beginning and 163.4MB in the end (delta: 103.7MB). Peak memory consumption was 105.0MB. Max. memory is 8.0GB. [2023-12-25 04:54:26,442 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.45ms. Allocated memory is still 198.2MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.43ms. Allocated memory is still 343.9MB. Free memory was 294.5MB in the beginning and 283.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.64ms. Allocated memory is still 343.9MB. Free memory was 283.1MB in the beginning and 281.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.39ms. Allocated memory is still 343.9MB. Free memory was 281.5MB in the beginning and 279.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 420.92ms. Allocated memory is still 343.9MB. Free memory was 279.7MB in the beginning and 267.9MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 882997.32ms. Allocated memory is still 343.9MB. Free memory was 267.1MB in the beginning and 163.4MB in the end (delta: 103.7MB). Peak memory consumption was 105.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while NwaCegarLoop was analyzing trace of length 42 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 882.9s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 157.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 80.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 76.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 176 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 768 IncrementalHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 101 mSDtfsCounter, 768 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 262 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 220.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=5, InterpolantAutomatonStates: 62, 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, 6 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 398.7s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 292 ConstructedInterpolants, 6 QuantifiedInterpolants, 1844 SizeOfPredicates, 26 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 119/160 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