/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_valuebound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:51:52,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:51:52,410 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:52,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:51:52,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:51:52,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:51:52,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:51:52,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:51:52,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:51:52,448 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:51:52,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:51:52,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:51:52,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:51:52,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:51:52,451 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:51:52,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:51:52,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:51:52,452 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:51:52,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:51:52,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:51:52,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:51:52,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:51:52,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:51:52,454 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:51:52,455 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:51:52,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:51:52,455 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:51:52,455 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:51:52,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:51:52,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:51:52,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:51:52,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:51:52,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:51:52,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:51:52,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:51:52,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:51:52,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:51:52,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:51:52,458 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:51:52,458 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:51:52,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:51:52,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:51:52,459 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:51:52,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:51:52,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:51:52,460 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:51:52,460 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:52,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:51:52,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:51:52,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:51:52,720 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:51:52,721 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:51:52,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/knuth_valuebound5.i [2023-12-25 03:51:53,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:51:54,105 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:51:54,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/knuth_valuebound5.i [2023-12-25 03:51:54,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b9fc1e2/d1a114e5db144d5d83bdc55c57b3170d/FLAGe70a102ce [2023-12-25 03:51:54,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b9fc1e2/d1a114e5db144d5d83bdc55c57b3170d [2023-12-25 03:51:54,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:51:54,128 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:51:54,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:51:54,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:51:54,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:51:54,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:51:54" (1/1) ... [2023-12-25 03:51:54,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3587bd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:54, skipping insertion in model container [2023-12-25 03:51:54,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:51:54" (1/1) ... [2023-12-25 03:51:54,156 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:51:54,295 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_valuebound5.i[948,961] [2023-12-25 03:51:54,320 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:51:54,332 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:51:54,344 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_valuebound5.i[948,961] [2023-12-25 03:51:54,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:51:54,384 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:51:54,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:54 WrapperNode [2023-12-25 03:51:54,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:51:54,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:51:54,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:51:54,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:51:54,392 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:54" (1/1) ... [2023-12-25 03:51:54,409 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:54" (1/1) ... [2023-12-25 03:51:54,427 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 75 [2023-12-25 03:51:54,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:51:54,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:51:54,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:51:54,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:51:54,435 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:54" (1/1) ... [2023-12-25 03:51:54,435 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:54" (1/1) ... [2023-12-25 03:51:54,437 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:54" (1/1) ... [2023-12-25 03:51:54,446 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:54,447 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:54" (1/1) ... [2023-12-25 03:51:54,447 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:54" (1/1) ... [2023-12-25 03:51:54,453 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:54" (1/1) ... [2023-12-25 03:51:54,455 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:54" (1/1) ... [2023-12-25 03:51:54,457 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:54" (1/1) ... [2023-12-25 03:51:54,458 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:54" (1/1) ... [2023-12-25 03:51:54,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:51:54,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:51:54,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:51:54,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:51:54,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:54" (1/1) ... [2023-12-25 03:51:54,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:51:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:51:54,505 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:54,519 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:54,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:51:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:51:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 03:51:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 03:51:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 03:51:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:51:54,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:51:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:51:54,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:51:54,606 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:51:54,608 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:51:59,635 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:51:59,658 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:51:59,658 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 03:51:59,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:51:59 BoogieIcfgContainer [2023-12-25 03:51:59,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:51:59,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:51:59,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:51:59,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:51:59,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:51:54" (1/3) ... [2023-12-25 03:51:59,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176eb359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:51:59, skipping insertion in model container [2023-12-25 03:51:59,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:51:54" (2/3) ... [2023-12-25 03:51:59,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176eb359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:51:59, skipping insertion in model container [2023-12-25 03:51:59,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:51:59" (3/3) ... [2023-12-25 03:51:59,666 INFO L112 eAbstractionObserver]: Analyzing ICFG knuth_valuebound5.i [2023-12-25 03:51:59,686 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:51:59,687 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:51:59,728 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:51:59,735 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;@3b8546c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:51:59,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:51:59,740 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:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 03:51:59,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:51:59,746 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:59,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:51:59,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:51:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1677847985, now seen corresponding path program 1 times [2023-12-25 03:51:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:51:59,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868989327] [2023-12-25 03:51:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:51:59,765 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:59,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:51:59,768 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:59,780 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:52:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:52:00,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:52:00,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:52:00,067 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:52:00,067 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:52:00,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:52:00,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868989327] [2023-12-25 03:52:00,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868989327] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:52:00,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:52:00,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:52:00,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166059186] [2023-12-25 03:52:00,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:52:00,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:52:00,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:52:00,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:52:00,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:52:00,100 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:52:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:52:00,162 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2023-12-25 03:52:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:52:00,164 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:52:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:52:00,169 INFO L225 Difference]: With dead ends: 54 [2023-12-25 03:52:00,169 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 03:52:00,171 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:52:00,174 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:52:00,175 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:52:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 03:52:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 03:52:00,199 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:52:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-12-25 03:52:00,201 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 28 [2023-12-25 03:52:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:52:00,201 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-12-25 03:52:00,201 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:52:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-12-25 03:52:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 03:52:00,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:52:00,203 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:52:00,227 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 03:52:00,417 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:52:00,417 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:52:00,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:52:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -201606027, now seen corresponding path program 1 times [2023-12-25 03:52:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:52:00,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172551920] [2023-12-25 03:52:00,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:52:00,419 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:52:00,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:52:00,421 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:52:00,422 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:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:52:00,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:52:00,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:52:07,193 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:52:07,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:52:19,888 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:52:32,828 WARN L293 SmtUtils]: Spent 8.14s 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:52:37,601 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:52:54,046 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:52:58,104 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:53:14,783 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:53:31,204 WARN L293 SmtUtils]: Spent 8.14s 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:35,294 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:53:47,964 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:54:05,001 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 03:54:13,144 WARN L293 SmtUtils]: Spent 8.14s 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:54:17,357 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| (_ bv5 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:54:17,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:54:17,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172551920] [2023-12-25 03:54:17,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172551920] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:54:17,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [229257933] [2023-12-25 03:54:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:54:17,359 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:54:17,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:54:17,405 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:54:17,406 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:54:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:54:23,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 03:54:23,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:54:31,544 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:54:31,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:54:49,689 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:55:06,131 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:55:10,223 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 03:55:26,661 WARN L293 SmtUtils]: Spent 8.16s 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:55:43,135 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:55:47,262 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 03:55:59,719 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:56:17,060 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:56:25,247 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:56:25,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [229257933] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:56:25,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:56:25,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-12-25 03:56:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733593390] [2023-12-25 03:56:25,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:56:25,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 03:56:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:56:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 03:56:25,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=133, Unknown=7, NotChecked=196, Total=380 [2023-12-25 03:56:25,251 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 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 03:56:32,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:56:36,415 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 03:56:40,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:56:44,448 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 03:56:48,454 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 03:56:54,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:57:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:57:00,519 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2023-12-25 03:57:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 03:57:00,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 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) Word has length 28 [2023-12-25 03:57:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:57:00,540 INFO L225 Difference]: With dead ends: 43 [2023-12-25 03:57:00,540 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 03:57:00,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=61, Invalid=200, Unknown=7, NotChecked=238, Total=506 [2023-12-25 03:57:00,541 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:57:00,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 89 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 123 Invalid, 5 Unknown, 0 Unchecked, 31.3s Time] [2023-12-25 03:57:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 03:57:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2023-12-25 03:57:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:57:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-25 03:57:00,551 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 28 [2023-12-25 03:57:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:57:00,552 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-25 03:57:00,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 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 03:57:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-25 03:57:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 03:57:00,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:57:00,553 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:57:00,590 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 03:57:00,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 03:57:00,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 03:57:00,957 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:57:00,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:57:00,957 INFO L85 PathProgramCache]: Analyzing trace with hash -48751610, now seen corresponding path program 1 times [2023-12-25 03:57:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:57:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926527961] [2023-12-25 03:57:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:57:00,958 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:57:00,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:57:00,959 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 03:57:00,961 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 03:57:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:57:01,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:57:01,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:57:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 03:57:01,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:57:01,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:57:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926527961] [2023-12-25 03:57:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926527961] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:57:01,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:57:01,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:57:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411393203] [2023-12-25 03:57:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:57:01,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:57:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:57:01,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:57:01,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:57:01,720 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:57:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:57:02,887 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2023-12-25 03:57:02,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:57:02,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2023-12-25 03:57:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:57:02,898 INFO L225 Difference]: With dead ends: 45 [2023-12-25 03:57:02,898 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 03:57:02,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:57:02,899 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:57:02,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 03:57:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 03:57:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2023-12-25 03:57:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 03:57:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-12-25 03:57:02,907 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 33 [2023-12-25 03:57:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:57:02,908 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-12-25 03:57:02,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:57:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-12-25 03:57:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 03:57:02,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:57:02,909 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:57:02,927 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 03:57:03,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:57:03,124 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:57:03,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:57:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1500178133, now seen corresponding path program 1 times [2023-12-25 03:57:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:57:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088919092] [2023-12-25 03:57:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:57:03,125 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:57:03,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:57:03,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:57:03,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 03:57:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:57:03,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 03:57:03,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:57:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 03:57:17,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:57:53,295 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:57:57,718 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse1 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8)) (.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)))) (let ((.cse4 (bvmul (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8)) (_ bv4 32))) (.cse5 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse2))) (.cse6 (bvmul (_ bv8 32) .cse0)) (.cse7 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse1))) (.cse3 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|))) (or (= (bvadd (bvneg (bvmul .cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~a~0#1|))) (bvneg (bvmul (bvadd (bvmul (_ bv4 32) .cse1) (bvmul (_ bv4 32) .cse2)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~a~0#1|))) (bvneg .cse3) .cse4 .cse5 .cse6 .cse7) (_ bv0 32)) (not (= (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse2)))) .cse4 .cse5 .cse6 (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse0))) .cse7) .cse3)))))) is different from true [2023-12-25 03:58:10,600 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 03:58:18,801 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:58:23,481 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse1 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8)) (.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)))) (let ((.cse4 (bvmul (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8)) (_ bv4 32))) (.cse5 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse2))) (.cse6 (bvmul (_ bv8 32) .cse0)) (.cse7 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse1))) (.cse3 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|))) (or (= (bvadd (bvneg (bvmul .cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~a~0#1|))) (bvneg (bvmul (bvadd (bvmul (_ bv4 32) .cse1) (bvmul (_ bv4 32) .cse2)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~a~0#1|))) (bvneg .cse3) .cse4 .cse5 .cse6 .cse7) (_ bv0 32)) (not (= (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse2)))) .cse4 .cse5 .cse6 (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse0))) .cse7) .cse3)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32))))))) is different from true [2023-12-25 03:58:35,780 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:58:48,625 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:58:52,681 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8)) (.cse2 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse3 (bvmul (_ bv8 32) .cse0)) (.cse4 (bvmul (bvmul .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) (_ bv4 32))) (.cse5 (bvmul (_ bv4 32) (bvmul .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse6 (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse7 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21|))) (or (not (= (bvadd (bvneg (bvmul (bvmul (_ bv4 32) .cse0) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse2)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) .cse3 .cse4 .cse5 .cse6) .cse7)) (= (bvadd .cse3 .cse4 (bvneg (bvmul (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) .cse0)) (bvneg (bvmul (bvadd (bvmul (_ bv4 32) .cse2) (bvmul (_ bv4 32) .cse1)) (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) .cse5 .cse6 (bvneg .cse7)) (_ bv0 32)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ bv2 32))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:59:04,975 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:59:17,405 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:59:29,671 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 03:59:42,026 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:59:46,111 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_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8)) (.cse2 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse3 (bvmul (_ bv8 32) .cse0)) (.cse4 (bvmul (bvmul .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) (_ bv4 32))) (.cse5 (bvmul (_ bv4 32) (bvmul .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse6 (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (.cse7 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21|))) (or (not (= (bvadd (bvneg (bvmul (bvmul (_ bv4 32) .cse0) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse2)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) .cse3 .cse4 .cse5 .cse6) .cse7)) (= (bvadd .cse3 .cse4 (bvneg (bvmul (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) .cse0)) (bvneg (bvmul (bvadd (bvmul (_ bv4 32) .cse2) (bvmul (_ bv4 32) .cse1)) (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) .cse5 .cse6 (bvneg .cse7)) (_ bv0 32)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ bv2 32))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 03:59:58,578 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 04:00:06,732 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:00:23,812 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:00:31,975 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:00:40,153 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 04:00:44,213 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 32))) (let ((.cse8 (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse4 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse3 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8))) (let ((.cse2 (bvmul (_ bv4 32) (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1| .cse3))) (.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) (.cse5 (bvmul (_ bv8 32) .cse1)) (.cse6 (bvmul (_ bv4 32) (bvmul .cse4 |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse7 (bvmul (_ bv4 32) (bvmul |ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8))))) (or (not (= .cse0 (bvadd (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse1))) .cse2 (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvadd (bvmul (_ bv8 32) .cse3) (bvmul .cse4 (_ bv8 32))))) .cse5 .cse6 .cse7))) (= (_ bv0 32) (bvadd .cse2 (bvneg (bvmul (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (bvadd (bvmul (_ bv4 32) .cse3) (bvmul .cse4 (_ bv4 32))))) (bvneg .cse0) .cse5 .cse6 .cse7 (bvneg (bvmul (bvmul (_ bv4 32) |ULTIMATE.start_main_~a~0#1|) .cse1)))) (not (bvugt |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv5 32)))))))) is different from true [2023-12-25 04:00:44,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:00:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088919092] [2023-12-25 04:00:44,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088919092] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:00:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1557866367] [2023-12-25 04:00:44,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:00:44,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 04:00:44,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 04:00:44,216 INFO L229 MonitoredProcess]: Starting monitored process 7 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:00:44,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-25 04:00:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:00:49,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:00:49,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:01:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 04:01:04,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:01:23,129 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:36,001 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:01:44,205 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:01:56,483 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:02:04,692 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:13,181 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (let ((.cse2 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)) (.cse0 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| .cse8))) (let ((.cse3 (bvmul (_ bv4 32) (bvmul .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (.cse7 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31|)) (.cse4 (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| .cse0))) (.cse5 (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| .cse8) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (.cse6 (bvmul (_ bv8 32) .cse2))) (or (not (= (bvadd (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse0) (bvmul .cse1 (_ bv8 32))) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (bvmul (_ bv4 32) .cse2))) .cse3 .cse4 .cse5 .cse6) .cse7)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (_ bv2 32)) (= (_ bv0 32) (bvadd (bvneg (bvmul (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|) .cse2)) .cse3 (bvneg .cse7) (bvneg (bvmul (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|) (bvadd (bvmul (_ bv4 32) .cse0) (bvmul (_ bv4 32) .cse1)))) .cse4 .cse5 .cse6))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:02:25,451 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:02:33,630 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:50,193 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:02:58,363 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 04:03:11,113 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:03:19,315 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:03:36,863 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:45,029 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:03:53,200 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:03:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1557866367] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:03:53,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:03:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2023-12-25 04:03:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537840033] [2023-12-25 04:03:53,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:03:53,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 04:03:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:03:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 04:03:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=203, Unknown=6, NotChecked=198, Total=462 [2023-12-25 04:03:53,203 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 04:04:01,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:04:05,296 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:04:09,301 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:13,307 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:04:17,309 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:21,324 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:04:25,328 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:33,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:04:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:04:39,235 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2023-12-25 04:04:39,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 04:04:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2023-12-25 04:04:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:04:39,260 INFO L225 Difference]: With dead ends: 51 [2023-12-25 04:04:39,260 INFO L226 Difference]: Without dead ends: 49 [2023-12-25 04:04:39,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 49.8s TimeCoverageRelationStatistics Valid=74, Invalid=286, Unknown=6, NotChecked=234, Total=600 [2023-12-25 04:04:39,261 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 54 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 14 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:04:39,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 87 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 173 Invalid, 8 Unknown, 0 Unchecked, 43.6s Time] [2023-12-25 04:04:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-25 04:04:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-12-25 04:04:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 04:04:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2023-12-25 04:04:39,269 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 38 [2023-12-25 04:04:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:04:39,270 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2023-12-25 04:04:39,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 04:04:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2023-12-25 04:04:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 04:04:39,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:04:39,271 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:04:39,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-25 04:04:39,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 04:04:39,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:04:39,673 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:04:39,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:04:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1015795441, now seen corresponding path program 1 times [2023-12-25 04:04:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:04:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677701878] [2023-12-25 04:04:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:04:39,674 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:04:39,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:04:39,675 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:04:39,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 04:04:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:04:40,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 04:04:40,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:04:52,425 WARN L293 SmtUtils]: Spent 9.80s 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:05:02,171 WARN L293 SmtUtils]: Spent 9.75s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:05:11,180 WARN L293 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:05:21,170 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:05:31,029 WARN L293 SmtUtils]: Spent 9.86s 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:05:35,565 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~n~0#1| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~d~0#1|))) (and (= (bvurem |ULTIMATE.start_main_~n~0#1| .cse0) |c_ULTIMATE.start_main_~k~0#1|) (= (bvadd (bvmul (_ bv4 32) (bvudiv |ULTIMATE.start_main_~n~0#1| .cse0)) (bvmul (bvneg (bvudiv |ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~d~0#1|)) (_ bv4 32))) |c_ULTIMATE.start_main_~q~0#1|) (= (bvurem |ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~d~0#1|) |c_ULTIMATE.start_main_~r~0#1|) (= |c_ULTIMATE.start_main_~s~0#1| ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~n~0#1|)))) (bvule |ULTIMATE.start_main_~n~0#1| (_ bv5 32))))) (bvule |c_ULTIMATE.start_main_~d~0#1| (_ bv5 32)) (bvugt |c_ULTIMATE.start_main_~d~0#1| (_ bv2 32))) is different from false [2023-12-25 04:05:45,327 WARN L293 SmtUtils]: Spent 9.72s 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:05:55,041 WARN L293 SmtUtils]: Spent 9.71s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:06:04,101 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:06:13,931 WARN L293 SmtUtils]: Spent 9.83s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:06:23,674 WARN L293 SmtUtils]: Spent 9.74s 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:06:33,498 WARN L293 SmtUtils]: Spent 9.72s 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) Received shutdown request... [2023-12-25 04:06:35,355 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 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:06:35,355 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:36,377 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:06:36,564 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:36,664 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:36,666 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:06:36,666 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 52 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-25 04:06:36,669 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-25 04:06:36,671 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:06:36,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:06:36 BoogieIcfgContainer [2023-12-25 04:06:36,673 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:06:36,673 INFO L158 Benchmark]: Toolchain (without parser) took 882545.44ms. Allocated memory is still 377.5MB. Free memory was 314.3MB in the beginning and 182.9MB in the end (delta: 131.4MB). Peak memory consumption was 132.2MB. Max. memory is 8.0GB. [2023-12-25 04:06:36,674 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 229.6MB. Free memory is still 177.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:06:36,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.16ms. Allocated memory is still 377.5MB. Free memory was 314.3MB in the beginning and 301.1MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 04:06:36,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.65ms. Allocated memory is still 377.5MB. Free memory was 301.1MB in the beginning and 299.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:06:36,674 INFO L158 Benchmark]: Boogie Preprocessor took 32.83ms. Allocated memory is still 377.5MB. Free memory was 299.3MB in the beginning and 296.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 04:06:36,675 INFO L158 Benchmark]: RCFGBuilder took 5191.14ms. Allocated memory is still 377.5MB. Free memory was 296.9MB in the beginning and 279.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-25 04:06:36,675 INFO L158 Benchmark]: TraceAbstraction took 877012.28ms. Allocated memory is still 377.5MB. Free memory was 279.0MB in the beginning and 182.9MB in the end (delta: 96.1MB). Peak memory consumption was 96.5MB. Max. memory is 8.0GB. [2023-12-25 04:06:36,676 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.44ms. Allocated memory is still 229.6MB. Free memory is still 177.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.16ms. Allocated memory is still 377.5MB. Free memory was 314.3MB in the beginning and 301.1MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.65ms. Allocated memory is still 377.5MB. Free memory was 301.1MB in the beginning and 299.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.83ms. Allocated memory is still 377.5MB. Free memory was 299.3MB in the beginning and 296.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 5191.14ms. Allocated memory is still 377.5MB. Free memory was 296.9MB in the beginning and 279.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 877012.28ms. Allocated memory is still 377.5MB. Free memory was 279.0MB in the beginning and 182.9MB in the end (delta: 96.1MB). Peak memory consumption was 96.5MB. 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 NwaCegarLoop was analyzing trace of length 52 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 877.0s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 82.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 76.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 333 SdHoareTripleChecker+Invalid, 73.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 232 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 321 IncrementalHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 101 mSDtfsCounter, 321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 90.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=4, InterpolantAutomatonStates: 31, 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, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 12.5s SatisfiabilityAnalysisTime, 663.3s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 917 SizeOfPredicates, 23 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 130/162 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