/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/knuth_valuebound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:51:11,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:51:11,498 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 03:51:11,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:51:11,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:51:11,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:51:11,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:51:11,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:51:11,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:51:11,516 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:51:11,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:51:11,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:51:11,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:51:11,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:51:11,518 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:51:11,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:51:11,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:51:11,518 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:51:11,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:51:11,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:51:11,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:51:11,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:51:11,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:51:11,520 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:51:11,520 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:51:11,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:51:11,520 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:51:11,521 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:51:11,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:51:11,521 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:51:11,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:51:11,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:51:11,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:51:11,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:51:11,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:51:11,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:51:11,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:51:11,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:51:11,523 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:51:11,523 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:51:11,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:51:11,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:51:11,524 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:51:11,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:51:11,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:51:11,524 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:51:11,524 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 03:51:11,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:51:11,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:51:11,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:51:11,741 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:51:11,741 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:51:11,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/knuth_valuebound100.i [2023-12-25 03:51:12,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:51:12,972 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:51:12,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/knuth_valuebound100.i [2023-12-25 03:51:12,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3796f45/63a55ab135624a5c986d453f627f1db1/FLAG07914f26f [2023-12-25 03:51:12,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3796f45/63a55ab135624a5c986d453f627f1db1 [2023-12-25 03:51:12,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:51:12,998 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:51:12,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:51:12,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:51:13,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:51:13,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:51:12" (1/1) ... [2023-12-25 03:51:13,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b51a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13, skipping insertion in model container [2023-12-25 03:51:13,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:51:12" (1/1) ... [2023-12-25 03:51:13,027 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:51:13,158 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/knuth_valuebound100.i[948,961] [2023-12-25 03:51:13,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:51:13,220 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:51:13,234 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/knuth_valuebound100.i[948,961] [2023-12-25 03:51:13,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:51:13,271 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:51:13,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13 WrapperNode [2023-12-25 03:51:13,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:51:13,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:51:13,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:51:13,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:51:13,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,316 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 75 [2023-12-25 03:51:13,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:51:13,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:51:13,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:51:13,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:51:13,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,336 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-25 03:51:13,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:51:13,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:51:13,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:51:13,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:51:13,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (1/1) ... [2023-12-25 03:51:13,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:51:13,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:51:13,384 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 03:51:13,419 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 03:51:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:51:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:51:13,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 03:51:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 03:51:13,427 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 03:51:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:51:13,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:51:13,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:51:13,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:51:13,483 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:51:13,486 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:51:18,482 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:51:18,504 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:51:18,504 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 03:51:18,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:51:18 BoogieIcfgContainer [2023-12-25 03:51:18,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:51:18,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:51:18,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:51:18,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:51:18,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:51:12" (1/3) ... [2023-12-25 03:51:18,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20de70e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:51:18, skipping insertion in model container [2023-12-25 03:51:18,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:13" (2/3) ... [2023-12-25 03:51:18,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20de70e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:51:18, skipping insertion in model container [2023-12-25 03:51:18,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:51:18" (3/3) ... [2023-12-25 03:51:18,510 INFO L112 eAbstractionObserver]: Analyzing ICFG knuth_valuebound100.i [2023-12-25 03:51:18,522 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:51:18,523 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:51:18,552 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:51:18,557 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;@21f315fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:51:18,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:51:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 03:51:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 03:51:18,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:51:18,565 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:51:18,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:51:18,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:51:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1677847985, now seen corresponding path program 1 times [2023-12-25 03:51:18,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:51:18,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759253293] [2023-12-25 03:51:18,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:51:18,578 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 03:51:18,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:51:18,580 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 03:51:18,585 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 03:51:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:51:18,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:51:18,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:51:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 03:51:18,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:51:18,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:51:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759253293] [2023-12-25 03:51:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759253293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:51:18,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:51:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:51:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741471251] [2023-12-25 03:51:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:51:18,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:51:18,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:51:18,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:51:18,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:51:18,900 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 03:51:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:51:18,946 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2023-12-25 03:51:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:51:18,948 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-25 03:51:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:51:18,953 INFO L225 Difference]: With dead ends: 54 [2023-12-25 03:51:18,953 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 03:51:18,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:51:18,957 INFO L413 NwaCegarLoop]: 35 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, 35 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 03:51:18,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:51:18,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 03:51:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 03:51:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 03:51:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-12-25 03:51:18,981 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 28 [2023-12-25 03:51:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:51:18,981 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-12-25 03:51:18,982 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 03:51:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-12-25 03:51:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 03:51:18,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:51:18,983 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:51:19,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 03:51:19,208 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 03:51:19,209 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:51:19,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:51:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash -201606027, now seen corresponding path program 1 times [2023-12-25 03:51:19,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:51:19,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220055876] [2023-12-25 03:51:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:51:19,210 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 03:51:19,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:51:19,212 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 03:51:19,218 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 03:52:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:52:11,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:52:11,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:52:29,889 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:52:46,840 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:53:00,587 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:53:31,270 WARN L293 SmtUtils]: Spent 28.73s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:53:43,497 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:53:55,920 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:54:28,143 WARN L293 SmtUtils]: Spent 29.12s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:54:40,371 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:54:52,932 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:54:56,972 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ bv100 32)) (not (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4|) (let ((.cse0 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))) (let ((.cse2 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse0)) (.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (.cse3 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)))) (bvadd (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse0) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (bvneg (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (bvmul (_ bv4 32) .cse1))) (bvmul (bvmul .cse2 |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|) (_ bv4 32)) (bvneg (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (bvadd (bvmul (_ bv8 32) .cse3) (bvmul .cse2 (_ bv8 32))))) (bvmul (_ bv8 32) .cse1) (bvmul (_ bv4 32) (bvmul .cse3 |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))))))) (bvule |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ bv100 32)))) is different from false [2023-12-25 03:55:01,000 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ bv100 32)) (not (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4|) (let ((.cse0 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))) (let ((.cse2 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse0)) (.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (.cse3 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)))) (bvadd (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse0) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (bvneg (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (bvmul (_ bv4 32) .cse1))) (bvmul (bvmul .cse2 |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|) (_ bv4 32)) (bvneg (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (bvadd (bvmul (_ bv8 32) .cse3) (bvmul .cse2 (_ bv8 32))))) (bvmul (_ bv8 32) .cse1) (bvmul (_ bv4 32) (bvmul .cse3 |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))))))) (bvule |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ bv100 32)))) is different from true [2023-12-25 03:55:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 03:55:01,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:55:30,214 WARN L876 $PredicateComparison]: unable to prove that (= (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse1 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (.cse3 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse0 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse2))) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv8 32) .cse1)))) (bvmul (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse2)) (_ bv4 32)) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse1)) (bvmul (_ bv8 32) .cse3) (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse3))) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse0))))) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) is different from true [2023-12-25 03:55:43,577 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 03:55:48,234 WARN L876 $PredicateComparison]: unable to prove that (or (= (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse1 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (.cse3 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse0 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse2))) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv8 32) .cse1)))) (bvmul (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse2)) (_ bv4 32)) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse1)) (bvmul (_ bv8 32) .cse3) (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse3))) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse0))))) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32)))) is different from true [2023-12-25 03:56:04,711 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:56:08,770 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ BitVec 32))) (or (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5|) (let ((.cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv4294967294 32)))) (let ((.cse2 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|))) (.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)) (.cse3 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse1))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvmul (_ bv4 32) .cse0))) (bvmul (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse1) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) (_ bv4 32)) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| .cse2)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvadd (bvmul .cse3 (_ bv8 32)) (bvmul (_ bv8 32) .cse2)))) (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)))))) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv2 32)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:56:25,355 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:56:41,889 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:56:45,981 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ BitVec 32))) (or (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5|) (let ((.cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv4294967294 32)))) (let ((.cse2 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|))) (.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)) (.cse3 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse1))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvmul (_ bv4 32) .cse0))) (bvmul (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse1) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) (_ bv4 32)) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| .cse2)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvadd (bvmul .cse3 (_ bv8 32)) (bvmul (_ bv8 32) .cse2)))) (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)))))) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv2 32)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:56:58,730 WARN L293 SmtUtils]: Spent 8.21s 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 03:57:15,881 WARN L293 SmtUtils]: Spent 8.18s 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 03:57:24,054 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 03:57:28,599 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 32))) (or (not (bvugt |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv100 32))) (= (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse3 (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse1 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse3)) (.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse2 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)))) (bvadd (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse0))) (bvmul (_ bv4 32) (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1| .cse1)) (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse1) (bvmul .cse2 (_ bv8 32))))) (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul .cse2 |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|)) (bvmul (_ bv4 32) (bvmul |ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse3))))))))) is different from true [2023-12-25 03:57:28,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:57:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220055876] [2023-12-25 03:57:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220055876] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:57:28,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [519186796] [2023-12-25 03:57:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:57:28,601 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:57:28,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:57:28,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 03:57:28,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-25 03:59:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:59:39,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 03:59:39,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:59:55,110 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:00:12,300 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:00:26,425 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:00:42,719 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:00:55,440 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:07,738 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:20,435 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 04:01:20,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:01:38,782 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:01:55,500 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:59,603 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ BitVec 32))) (or (= (let ((.cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv4294967294 32)))) (let ((.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|)) (.cse2 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse0)) (.cse3 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|)))) (bvadd (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse0))) (bvmul (_ bv8 32) .cse1) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| .cse2)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvmul (_ bv4 32) .cse1))) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| .cse3)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvadd (bvmul .cse2 (_ bv8 32)) (bvmul (_ bv8 32) .cse3))))))) (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11|)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv2 32)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:02:16,101 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:02:32,620 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:02:36,732 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ BitVec 32))) (or (= (let ((.cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv4294967294 32)))) (let ((.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|)) (.cse2 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse0)) (.cse3 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|)))) (bvadd (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse0))) (bvmul (_ bv8 32) .cse1) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| .cse2)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvmul (_ bv4 32) .cse1))) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| .cse3)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvadd (bvmul .cse2 (_ bv8 32)) (bvmul (_ bv8 32) .cse3))))))) (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11|)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv2 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:02:49,200 WARN L293 SmtUtils]: Spent 8.20s 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:03:06,610 WARN L293 SmtUtils]: Spent 8.21s 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:03:14,801 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:03:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [519186796] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:03:14,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:03:14,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-12-25 04:03:14,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044045447] [2023-12-25 04:03:14,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:03:14,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 04:03:14,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:03:14,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 04:03:14,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=133, Unknown=12, NotChecked=232, Total=420 [2023-12-25 04:03:14,804 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 04:03:21,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:03:25,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:03:29,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:03:33,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:03:37,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:04:55,033 WARN L293 SmtUtils]: Spent 58.90s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:04:59,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:05:03,967 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 [0] [2023-12-25 04:05:07,975 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 [0] [2023-12-25 04:05:11,979 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 [0] [2023-12-25 04:05:15,983 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 [0] [2023-12-25 04:05:20,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:05:24,016 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 [0] [2023-12-25 04:05:28,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ bv100 32)) (not (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4|) (let ((.cse1 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))) (let ((.cse3 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse1)) (.cse2 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (.cse4 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)))) (bvadd (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse1) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (bvneg (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (bvmul (_ bv4 32) .cse2))) (bvmul (bvmul .cse3 |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|) (_ bv4 32)) (bvneg (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (bvadd (bvmul (_ bv8 32) .cse4) (bvmul .cse3 (_ bv8 32))))) (bvmul (_ bv8 32) .cse2) (bvmul (_ bv4 32) (bvmul .cse4 |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))))))) (bvule |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ bv100 32)))))) (and .cse0 (or (= (_ bv1 32) c___VERIFIER_assert_~cond) (and .cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) is different from false [2023-12-25 04:05:33,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:05:37,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:05:41,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:05:46,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:05:50,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:05:55,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:05:59,536 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 [] Received shutdown request... [2023-12-25 04:06:01,834 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:06:01,872 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:06:01,878 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 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:06:02,893 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:06:02,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2023-12-25 04:06:03,073 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:06:03,136 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:06:03,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 207.9s TimeCoverageRelationStatistics Valid=59, Invalid=201, Unknown=16, NotChecked=324, Total=600 [2023-12-25 04:06:03,138 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 84.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:06:03,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 89 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 18 Unknown, 44 Unchecked, 84.5s Time] [2023-12-25 04:06:03,139 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:06:03,140 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 04:06:03,143 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-25 04:06:03,146 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:06:03,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:06:03 BoogieIcfgContainer [2023-12-25 04:06:03,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:06:03,148 INFO L158 Benchmark]: Toolchain (without parser) took 890149.74ms. Allocated memory is still 305.1MB. Free memory was 253.0MB in the beginning and 106.8MB in the end (delta: 146.2MB). Peak memory consumption was 145.5MB. Max. memory is 8.0GB. [2023-12-25 04:06:03,148 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 178.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:06:03,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.69ms. Allocated memory is still 305.1MB. Free memory was 253.0MB in the beginning and 239.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 04:06:03,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.85ms. Allocated memory is still 305.1MB. Free memory was 239.7MB in the beginning and 237.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:06:03,149 INFO L158 Benchmark]: Boogie Preprocessor took 31.18ms. Allocated memory is still 305.1MB. Free memory was 237.9MB in the beginning and 235.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:06:03,149 INFO L158 Benchmark]: RCFGBuilder took 5156.34ms. Allocated memory is still 305.1MB. Free memory was 235.5MB in the beginning and 218.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-25 04:06:03,149 INFO L158 Benchmark]: TraceAbstraction took 884641.26ms. Allocated memory is still 305.1MB. Free memory was 218.0MB in the beginning and 106.8MB in the end (delta: 111.2MB). Peak memory consumption was 110.9MB. Max. memory is 8.0GB. [2023-12-25 04:06:03,150 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.93ms. Allocated memory is still 178.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.69ms. Allocated memory is still 305.1MB. Free memory was 253.0MB in the beginning and 239.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.85ms. Allocated memory is still 305.1MB. Free memory was 239.7MB in the beginning and 237.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.18ms. Allocated memory is still 305.1MB. Free memory was 237.9MB in the beginning and 235.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 5156.34ms. Allocated memory is still 305.1MB. Free memory was 235.5MB in the beginning and 218.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 884641.26ms. Allocated memory is still 305.1MB. Free memory was 218.0MB in the beginning and 106.8MB in the end (delta: 111.2MB). Peak memory consumption was 110.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 21). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 884.6s, OverallIterations: 2, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 168.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 84.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 83.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 44 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 53 mSDtfsCounter, 113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 207.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 182.6s SatisfiabilityAnalysisTime, 533.1s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 81 ConstructedInterpolants, 6 QuantifiedInterpolants, 785 SizeOfPredicates, 13 NumberOfNonLiveVariables, 183 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 60/72 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